Lower and upper bounds on graph communicabilities

DOI10.1016/J.IPL.2024.106501MaRDI QIDQ6602318zbMATH OpenFDO

Authors Amir Hossein Ghodrati, M. A. Hosseinzadeh

Publication date 11 September 2024

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.IPL.2024.106501

zbMATH Keywords

combinatorial problemscommunicabilityeigenvaluesmatrix exponentialsubgraph centrality

Mathematics Subject Classification ID

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

Recommendations

• Some bounds for total communicability of graphs
• Bounds for eigenvalues of a graph
• Spectral bounds for the betweenness of a graph
• A lower bound on graph entropy
• Quadrature rule-based bounds for functions of adjacency matrices

Cites work

• An introduction to the theory of graph spectra
• Bounds on the number of closed walks in a graph and its applications
• Estimating the Estrada index
• Functions of Matrices
• Graph theory
• scientific article; zbMATH DE number 3400923 (Why is no real title available?)
• Inequalities for the number of walks in graphs
• Lower bounds for Estrada Index
• Matrix functions in network analysis
• Network properties revealed through matrix functions
• Number of walks and degree powers in a graph
• Predicting triadic closure in networks using communicability distance functions
• Random Graphs
• Robustness of regular ring lattices based on natural connectivity
• Some bounds for total communicability of graphs
• The communicability distance in graphs
• The many facets of the Estrada indices of graphs and networks
• Updating and downdating techniques for optimizing network communicability

This page was built for publication: Lower and upper bounds on graph communicabilities

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