A conjecture about spectral distances between cycles, paths and certain trees
Combinatorics
2020-10-13 v1
Abstract
We confirm the following conjecture which has been proposed in [{\em Linear Algebra and its Applications}, {\bf 436} (2012), No. 5, 1425-1435.]: where is the spectral distance between vertex non-isomorphic graphs and with adjacency spectra for , and and denote the path and cycle on vertices, respectively; denotes the coalescence of and on one of the vertices of degree 1 of and the vertex of degree of ; and denotes the coalescence of and on the vertex of degree 1 of which is adjacent to a vertex of degree and the vertex of degree of .
Keywords
Cite
@article{arxiv.2010.05174,
title = {A conjecture about spectral distances between cycles, paths and certain trees},
author = {Alireza Abdollahi and Niloufar Zakeri},
journal= {arXiv preprint arXiv:2010.05174},
year = {2020}
}