Abstract
The complemented triangulation graph of a graph G, denoted by CT(G), is defined as the graph obtained from G by adding, for each edge uv of G, a new vertex whose neighbours are the vertices of G other than u and v. In this paper, we first obtain the A-spectra, the L-spectra, and the Q-spectra of the complemented triangulation graphs of regular graphs. By using the results, we construct infinitely many pairs of A-cospectral graphs, L-cospectral graphs, and Q-cospectral graphs. We also obtain the number of spanning trees and the Kirchhoff index of the complemented triangulation graphs of regular graphs.
Funder
Project of Institutions of Higher Learning Innovation Ability Enhancement of Gansu Province
Subject
General Mathematics,Engineering (miscellaneous),Computer Science (miscellaneous)
Reference21 articles.
1. Spectra of Graphs;Brouwer,2012
2. Spectra of Graphs—Theory and Applications;Cvetković,1995
3. An Introduction to the Theory of Graph Spectra;Cvetković,2010
4. The spectrum and the signless Laplacian spectrum of coronae
5. The spectrum of the edge corona of two graphs