@Article{JMS-49-1,
author = {Zhu, Xue-Qin and Tian, Gui-Xian and Shu-Yu, Cui},
title = {Spectra of Corona Based on the Total Graph},
journal = {Journal of Mathematical Study},
year = {2016},
volume = {49},
number = {1},
pages = {72--81},
abstract = {<p style="text-align: justify;">For two simple connected graphs $G_1$ and $G_2$, we introduce a new graph operation
called the total corona $G_1⊛G_2$ on $G_1$ and $G_2$ involving the total graph of $G_1.$ Subsequently, the adjacency (respectively, Laplacian and signless Laplacian) spectra
of $G_1⊛G_2$ are determined in terms of these of a regular graph $G_1$ and an arbitrary
graph $G_2.$ As applications, we construct infinitely many pairs of adjacency (respectively,
Laplacian and signless Laplacian) cospectral graphs. Besides we also compute
the number of spanning trees of $G_1⊛G_2.$</p>},
issn = {2617-8702},
doi = {https://doi.org/10.4208/jms.v49n1.16.09},
url = {https://global-sci.com/article/87792/spectra-of-corona-based-on-the-total-graph}
}