Coronae graphs and their $\alpha$-eigenvalues
Combinatorics
2020-08-05 v1
Abstract
Let and be two simple connected graphs. The invariant \textit{coronal} of graph is used in order to determine the -eigenvalues of four different types of graph equations that are and the other two`s are and which are obtained using the -graph of . As an application we construct infinitely many pairs of non-isomorphic -Isospectral graph.
Cite
@article{arxiv.2008.01317,
title = {Coronae graphs and their $\alpha$-eigenvalues},
author = {Muhammad Ateeq Tahir and Xiao-Dong Zhang},
journal= {arXiv preprint arXiv:2008.01317},
year = {2020}
}
Comments
15 pages, 3figures