Measures of information spread, spanning trees, and walks in regular graphs
Utilitas Mathematica · 17.06.2026 · 127 · 327-339
DOI: 10.61091/um127-20 ↗Kurz gefasst
Fachartikel in der Zeitschrift Utilitas Mathematica, online erschienen am 17.06.2026. Verfasst von Gregory P Constantine und 2 weiteren Autor:innen.
Abstract (Originalsprache)
Measures of spread of information are introduced, with applications to neuronal activity in regions of a brain or to the design of artificial robotic networks in which efficient transmission of information is sought. We make links to spectral connectivity measures in graphs, such as spanning trees and higher-order diameters (as defined here). The exposition is then specialized to regular graphs by developing a formula that expresses the number of spanning trees in terms of walks in the complementary graph. Using traces, we then develop bounds for the number of spanning trees. Two approaches are used to establish such bounds: the first involves a logarithmic series expansion of the number of spanning trees in the complementary graph, while the second relies on certain lp norm inequalities. Consequences to bipartite graphs are then examined.
Zitieren
APA
Constantine, G. P., Ganesh, V., & Magda, G. (2026). Measures of information spread, spanning trees, and walks in regular graphs. Utilitas Mathematica, 127, 327-339. https://doi.org/10.61091/um127-20
Vancouver
Constantine GP, Ganesh V, Magda G. Measures of information spread, spanning trees, and walks in regular graphs. Utilitas Mathematica. 2026;127:327-339. doi:10.61091/um127-20
BibTeX
@article{Constantine2026,
author = {Constantine, Gregory P and Ganesh, Vijay and Magda, Gregory},
title = {Measures of information spread, spanning trees, and walks in regular graphs},
journal = {Utilitas Mathematica},
year = {2026},
volume = {127},
pages = {327--339},
doi = {10.61091/um127-20}
}
EUVIMED