Relating centralities in graphs and the principal eigenvector of its distance matrix

DOI10.22199/issn.0717-6279-2021-01-0014zbMath1478.05090OpenAlexW3123732785MaRDI QIDQ5027710

Bruno B. Monteiro, Renata R. Del-Vecchio, Celso M. jun. da Silva

Publication date: 7 February 2022

Published in: Proyecciones (Antofagasta) (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.22199/issn.0717-6279-2021-01-0014

zbMATH Keywords

principal eigenvectordistance matrixcentralityspectral closeness

Mathematics Subject Classification ID

Small world graphs, complex networks (graph-theoretic aspects) (05C82) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)

Uses Software

• nauty
• SageMath
• Traces

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Spectra of graphs
• Sharp upper bounds on the distance spectral radius of a graph
• On the distance and distance signless Laplacian spectral radii of bicyclic graphs
• Practical graph isomorphism. II.
• Centralization of transmission in networks
• The centrality index of a graph
• The distance spectrum of the pathP_nand The First Distance Eigenvector of Connected Graphs
• Ranking of Closeness Centrality for Large-Scale Social Networks
• Extremal Properties of Graphs and Eigencentrality in Trees with a Given Degree Sequence
• Network Measures in Civil Air Transport: A Case Study of Lufthansa
• Some New Results on the Eigenvector Centrality