On conjectures of network distance measures by using graph spectra

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.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…