170
Views
1
CrossRef citations to date
0
Altmetric
Articles

Equitable partition and star set formulas for the subgraph centrality of graphs

ORCID Icon, &
Pages 3142-3150 | Received 14 Jul 2020, Accepted 11 Sep 2020, Published online: 26 Sep 2020

References

  • Leavitt HJ. Some effects of certain communication patterns on group performance. J Abnorm Soc Psychol. 1951;46(1):38–50.
  • Freeman LC. A set of measures of centrality based on betweenness. Sociometry. 1977;40(1):35–41.
  • Katz LA. A new status index derived from sociometric analysis. Psychometrika. 1953;18(1):39–43.
  • Hage P, Harary F. Eccentricity and centrality in networks. Soc Netw. 1995;17(1):57–63.
  • Benzi M, Klymko C. Total communicability as a centrality measure. J Complex Netw. 2013;1(2):124–149.
  • Qi X, Fuller E, Wu Q, et al. Laplacian centrality: a new centrality measure for weighted networks. Inf Sci. 2012;194:240–253.
  • Sola L, Romance M, Criado R, et al. Eigenvector centrality of nodes in multiplex networks. Chaos. 2013;23(3):033131.
  • Bonacich P. Factoring and weighting approaches to status scores and clique identification. J Math Sociol. 1972;2(1):113–120.
  • Estrada E, Rodríguez-Velázquez JA. Subgraph centrality in complex networks. Phys Rev E. 2005;71(5):056103.
  • Estrada E. Characterization of the amino acid contribution to the folding degree of proteins. Proteins. 2004;54(4):727–737.
  • Estrada E, Alhomaidhi AA, Al-Thukair F. Exploring the ‘Middle Earth’ of network spectra via a Gaussian matrix function. Chaos. 2017;27(2):023109.
  • Shang YL. Local natural connectivity in complex networks. Chinese Phys Lett. 2011;28(6):068903.
  • Estrada E. The structure of complex networks: theory and applications. New York (NY): Oxford University Press; 2012.
  • Estrada E, Gómez-Gardenes J. Network bipartivity and the transportation efficiency of European passenger airlines. Phys D. 2016;57–63:323–324.
  • Estrada E, Hatano N. Statistical-mechanical approach to subgraph centrality in complex networks. Chem Phys Lett. 2009;439(1–3):247–251.
  • Estrada E, Silver G. Accounting for the role of long walks on networks via a new matrix function. J Math Anal Appl. 2017;449(2):1581–1600.
  • Rodríguez-Velázquez JA, Estrada E, Gutiérrez A. Functional centrality in graphs. Linear Multilinear Algebra. 2007;55(3):293–302.
  • Cvetković D, Rowlinson P, Simić S. An introduction to the theory of graph spectra. Cambridge: Cambridge University Press; 2010.
  • Rowlinson P, Sciriha I. Some properties of the Hoffman-Singleton graph. Appl Anal Discrete Math. 2007;1(2):438–445.
  • Bell FK, Rowlinson P. On the multiplicities of graph eigenvalues. Bull London Math Soc. 2003;35(03):401–408.
  • Bu C, Zhang X, Zhou J. A note on the multiplicities of graph eigenvalues. Linear Algebra Appl. 2014;442:69–74.
  • Rowlinson P. Eigenvalue multiplicity in regular graphs. Discrete Appl Math. 2019;269:11–17.
  • Cvetković D, Lepović M, Rowlinson P, et al. The maximal exceptional graphs. J Combin Theory Ser B. 2002;86(2):347–363.
  • Stevanović D, Milošević M. A spectral proof of the uniqueness of a strongly regular graph with parameters (81,20,1,6). Eur J Comb. 2009;30(4):957–968.
  • Cioabă SM, Haemers WH, Vermette J, et al. The graphs with all but two eigenvalues equal to ±1. J Algebr Comb. 2015;41(3):887–897.

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.