On conjectures of network distance measures by using graph spectra

2019/12/18 by Ilic, Aleksandar, Dehmer, Matthias
#05C05 #Combinatorics (math.CO) #FOS: Mathematics

paper · doi:10.48550/arxiv.1912.08412

Abstract

In this note we resolve three conjectures from [M. Dehmer, S. Pickl, Y. Shi, G. Yu, New inequalities for network distance measures by using graph spectra, Discrete Appl. Math. 252 (2019), 17--27] on the comparison of distance measures based on the graph spectra, by constructing families of counterexamples and using computer search.

Related

• Counterexamples to conjectures on graph distance measures based on topological indexes
• Spectra of variants of distance matrices of graphs and digraphs: a survey
• Some Thoughts on Graph Similarity
• Graph Distance from the Topological View of Non-backtracking Cycles
• Dependence of the average to-node distance on the node degree for random graphs and growing networks