On conjectures of network distance measures by using graph spectra
Combinatorics
2019-12-19 v1
Abstract
In this note we resolve three conjectures from [M. Dehmer, S. Pickl, Y. Shi, G. Yu, \emph{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.
Keywords
Cite
@article{arxiv.1912.08412,
title = {On conjectures of network distance measures by using graph spectra},
author = {Aleksandar Ilic and Matthias Dehmer},
journal= {arXiv preprint arXiv:1912.08412},
year = {2019}
}
Comments
4, pages, 2 figures