English

Coronae graphs and their $\alpha$-eigenvalues

Combinatorics 2020-08-05 v1

Abstract

Let G1G_1 and G2G_2 be two simple connected graphs. The invariant \textit{coronal} of graph is used in order to determine the α\alpha-eigenvalues of four different types of graph equations that are G1G2,G1G1G_1 \circ G_2, G_1\lozenge G_1 and the other two`s are G1G2G_1 \odot G_2 and G1G2G_1 \circleddash G_2 which are obtained using the RR-graph of G1G_1. As an application we construct infinitely many pairs of non-isomorphic α\alpha-Isospectral graph.

Keywords

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

R2 v1 2026-06-23T17:37:21.167Z