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

DOI10.1080/03081087.2020.1825609MaRDI QIDQ5045233zbMATH OpenOpenAlexFDO

Authors Yang Yang, Jiang Zhou, Changjiang Bu

Publication date 4 November 2022

Published in Linear and Multilinear Algebra (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/03081087.2020.1825609

zbMATH Keywords

adjacency matrixequitable partitionstar setsubgraph centrality

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• Vertex distinction with subgraph centrality: a proof of Estrada's conjecture and some generalizations
• New results and open problems on subgraph centrality
• Subgraph centrality and walk-regularity
• A maple package for integro-differential operators and boundary problems
• On the connection between the eigen-vectors of weighted graphs and their subgraphs

Cites work

• scientific article; zbMATH DE number 5977361 (Why is no real title available?)
• A new status index derived from sociometric analysis
• A note on the multiplicities of graph eigenvalues
• A spectral proof of the uniqueness of a strongly regular graph with parameters (81,20,1,6)
• Accounting for the role of long walks on networks via a new matrix function
• An introduction to the theory of graph spectra
• Eigenvalue multiplicity in regular graphs
• Eigenvector centrality of nodes in multiplex networks
• Exploring the “Middle Earth” of network spectra via a Gaussian matrix function
• Functional centrality in graphs
• Laplacian centrality: A new centrality measure for weighted networks
• Network bipartivity and the transportation efficiency of European passenger airlines
• ON THE MULTIPLICITIES OF GRAPH EIGENVALUES
• Some properties of the Hoffman-Singleton graph
• The graphs with all but two eigenvalues equal to \(\pm 1\)
• The maximal exceptional graphs

Cited in

(1)

• Vertex distinction with subgraph centrality: a proof of Estrada's conjecture and some generalizations

This page was built for publication: Equitable partition and star set formulas for the subgraph centrality of graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5045233)