Functional centrality in graphs
From MaRDI portal
Publication:3427138
DOI10.1080/03081080601002221zbMath1110.05073arXivmath/0610141OpenAlexW3098495730WikidataQ57974465 ScholiaQ57974465MaRDI QIDQ3427138
No author found.
Publication date: 14 March 2007
Published in: Linear and Multilinear Algebra (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/math/0610141
Hypergraphs (05C65) Combinatorial inequalities (05A20) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Inequalities involving eigenvalues and eigenvectors (15A42) Distance in graphs (05C12)
Related Items (10)
Equitable partition and star set formulas for the subgraph centrality of graphs ⋮ Structural Vulnerability and Robustness in Complex Networks: Different Approaches and Relationships Between them ⋮ A new method for centrality measurement using generalized fuzzy graphs ⋮ A combinatorial development of Fibonacci numbers in graph spectra ⋮ Subgraph centrality and walk-regularity ⋮ Centrality measure in graphs ⋮ On reliability indices of communication networks ⋮ ( ψ , p , q ) -vulnerabilities: A unified approach to network robustness ⋮ On the Limiting Behavior of Parameter-Dependent Network Centrality Measures ⋮ Three Hypergraph Eigenvector Centralities
Cites Work
This page was built for publication: Functional centrality in graphs
