Lower and upper bounds on graph communicabilities

DOI10.1016/J.IPL.2024.106501zbMATH Open1548.05304MaRDI QIDQ6602318

Amir Hossein Ghodrati, Mohammad A. Hosseinzadeh

Publication date: 11 September 2024

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

zbMATH Keywords

eigenvaluescombinatorial problemsmatrix exponentialcommunicabilitysubgraph centrality

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Inequalities for the number of walks in graphs
• The communicability distance in graphs
• Number of walks and degree powers in a graph
• The many facets of the Estrada indices of graphs and networks
• Estimating the Estrada index
• Bounds on the number of closed walks in a graph and its applications
• Some bounds for total communicability of graphs
• Predicting Triadic Closure in Networks Using Communicability Distance Functions
• Network Properties Revealed through Matrix Functions
• Robustness of regular ring lattices based on natural connectivity
• Updating and Downdating Techniques for Optimizing Network Communicability
• Lower bounds for Estrada Index
• Functions of Matrices
• Random Graphs
• Matrix functions in network analysis

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)