IDEAS home Printed from https://ideas.repec.org/a/eee/apmaco/v399y2021ics0096300321000527.html
   My bibliography  Save this article

Which numbers are status differences?

Author

Listed:
  • Lin, Hongying
  • Zhou, Bo

Abstract

Given a connected graph G, the status sG(x) of a vertex x of G is the sum of the distances from x to all other vertices in G, and the status difference of G is sd(G)=maxx,y∈V(G)(sG(x)−sG(y)). The status difference is a useful descriptor in communication networks. We determine the numbers that can be the status differences of trees and connected graphs, respectively, with fixed order, and characterize the trees with the first a few smallest status differences when the order is fixed. Also, we identify the trees with maximum status difference over all trees with fixed maximum degree, number of leaves, and diameter, respectively, as well as the series-reduced trees with maximum status difference.

Suggested Citation

  • Lin, Hongying & Zhou, Bo, 2021. "Which numbers are status differences?," Applied Mathematics and Computation, Elsevier, vol. 399(C).
    • Handle: RePEc:eee:apmaco:v:399:y:2021:i:c:s0096300321000527
    DOI: 10.1016/j.amc.2021.126004
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0096300321000527
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.amc.2021.126004?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Gert Sabidussi, 1966. "The centrality index of a graph," Psychometrika, Springer;The Psychometric Society, vol. 31(4), pages 581-603, December.
    2. K. Pravas & A. Vijayakumar, 2017. "Convex median and anti-median at prescribed distance," Journal of Combinatorial Optimization, Springer, vol. 33(3), pages 1021-1029, April.
    3. Dobrynin, Andrey A., 2019. "Infinite family of 2-connected transmission irregular graphs," Applied Mathematics and Computation, Elsevier, vol. 340(C), pages 1-4.
    4. A. J. Goldman, 1972. "Minimax Location of a Facility in a Network," Transportation Science, INFORMS, vol. 6(4), pages 407-418, November.
    5. Chiang Lin & Wei-Han Tsai & Jen-Ling Shang & Yuan-Jen Zhang, 2012. "Minimum statuses of connected graphs with fixed maximum degree and order," Journal of Combinatorial Optimization, Springer, vol. 24(3), pages 147-161, October.
    6. Dobrynin, Andrey A. & Sharafdini, Reza, 2020. "Stepwise transmission irregular graphs," Applied Mathematics and Computation, Elsevier, vol. 371(C).
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Ahmed Badawy & Jesus A. Fisteus & Tarek M. Mahmoud & Tarek Abd El-Hafeez, 2021. "Topic Extraction and Interactive Knowledge Graphs for Learning Resources," Sustainability, MDPI, vol. 14(1), pages 1-21, December.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Bezhaev, Anatoly Yu. & Dobrynin, Andrey A., 2021. "On quartic transmission irregular graphs," Applied Mathematics and Computation, Elsevier, vol. 399(C).
    2. De Masi, G. & Giovannetti, G. & Ricchiuti, G., 2013. "Network analysis to detect common strategies in Italian foreign direct investment," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 392(5), pages 1202-1214.
    3. Hyuk-Soo Kwon & Jihong Lee & Sokbae Lee & Ryungha Oh, 2022. "Knowledge spillovers and patent citations: trends in geographic localization, 1976–2015," Economics of Innovation and New Technology, Taylor & Francis Journals, vol. 31(3), pages 123-147, April.
    4. Mengying Cui & David Levinson, 2018. "Accessibility analysis of risk severity," Transportation, Springer, vol. 45(4), pages 1029-1050, July.
    5. Tao, Qizhi & Li, Haoyu & Wu, Qun & Zhang, Ting & Zhu, Yingjun, 2019. "The dark side of board network centrality: Evidence from merger performance," Journal of Business Research, Elsevier, vol. 104(C), pages 215-232.
    6. Jackie Krafft & Francesco Quatraro, 2011. "The Dynamics of Technological Knowledge: From Linearity to Recombination," Chapters, in: Cristiano Antonelli (ed.), Handbook on the Economic Complexity of Technological Change, chapter 7, Edward Elgar Publishing.
    7. Giulia Masi & Giorgio Ricchiuti, 2020. "From FDI network topology to macroeconomic instability," Journal of Economic Interaction and Coordination, Springer;Society for Economic Science with Heterogeneous Interacting Agents, vol. 15(1), pages 133-158, January.
    8. repec:hal:wpspec:info:hdl:2441/f6h8764enu2lskk9p5487a6cm is not listed on IDEAS
    9. Gomez, Daniel & Gonzalez-Aranguena, Enrique & Manuel, Conrado & Owen, Guillermo & del Pozo, Monica & Tejada, Juan, 2003. "Centrality and power in social networks: a game theoretic approach," Mathematical Social Sciences, Elsevier, vol. 46(1), pages 27-54, August.
    10. Sharon, Jane Olive & Rajalaxmi, T.M. & Klavžar, Sandi & Rajan, R. Sundara & Rajasingh, Indra, 2021. "Transmission in H-naphtalenic nanosheet," Applied Mathematics and Computation, Elsevier, vol. 406(C).
    11. Jackie Krafft & Francesco Quatraro & Pier Paolo Saviotti, 2011. "The knowledge-base evolution in biotechnology: a social network analysis," Economics of Innovation and New Technology, Taylor & Francis Journals, vol. 20(5), pages 445-475.
    12. Dixit, Shiv & Subramanian, Krishnamurthy, 2020. "Bank Coordination and Monetary Transmission: Evidence from India," MPRA Paper 103169, University Library of Munich, Germany.
    13. Jackie Krafft & Francesco Quatraro, 2011. "The dynamics of technological knowledge," Post-Print halshs-00727633, HAL.
    14. Umed Temurshoev, 2008. "Who's Who in Networks. Wanted: the Key Group," Working Papers 08-08, NET Institute, revised Sep 2008.
    15. Alireza Abbasi & Mahdi Jalili & Abolghasem Sadeghi-Niaraki, 2018. "Influence of network-based structural and power diversity on research performance," Scientometrics, Springer;Akadémiai Kiadó, vol. 117(1), pages 579-590, October.
    16. Li, Jing & Yu, Qian & Ma, Ding, 2024. "Does China's high-speed rail network promote inter-city technology transfer? ——A multilevel network analysis based on the electronic information industry," Transport Policy, Elsevier, vol. 145(C), pages 11-24.
    17. Chiang Lin & Wei-Han Tsai & Jen-Ling Shang & Yuan-Jen Zhang, 2012. "Minimum statuses of connected graphs with fixed maximum degree and order," Journal of Combinatorial Optimization, Springer, vol. 24(3), pages 147-161, October.
    18. Truong, Huynh Sang & Walz, Uwe, 2022. "Spillovers of PE Investments," SAFE Working Paper Series 357, Leibniz Institute for Financial Research SAFE.
    19. El-Khatib, Rwan & Fogel, Kathy & Jandik, Tomas, 2015. "CEO network centrality and merger performance," Journal of Financial Economics, Elsevier, vol. 116(2), pages 349-382.
    20. Namtirtha, Amrita & Dutta, Animesh & Dutta, Biswanath, 2018. "Identifying influential spreaders in complex networks based on kshell hybrid method," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 499(C), pages 310-324.
    21. Mulder, H.M. & Pelsmajer, M.J. & Reid, K.B., 2006. "Generalized centrality in trees," Econometric Institute Research Papers EI 2006-16, Erasmus University Rotterdam, Erasmus School of Economics (ESE), Econometric Institute.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:apmaco:v:399:y:2021:i:c:s0096300321000527. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: https://www.journals.elsevier.com/applied-mathematics-and-computation .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.