Spectra of Complemented Triangulation Graphs

: The complemented triangulation graph of a graph G , denoted by CT ( G ) , is deﬁned 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 ﬁrst 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 inﬁnitely 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.


Introduction
All graphs considered in this paper are undirected and simple. Let G = (V(G), E(G)) be a graph with vertex set V(G) = {v 1 , v 2 , . . . , v n } and edge set E(G). The adjacency matrix of G, denoted by A(G), is the n × n matrix whose (i, j)-entry is 1 if v i and v j are adjacent in G and 0 otherwise. We denote by d i = d G (v i ) the degree of v i in G and define D(G) as the diagonal matrix with diagonal entries d 1 , d 2 , . . . , d n . The Laplacian matrix of G and the signless Laplacian matrix of G are defined as L(G) = D(G) − A(G) and Q(G) = D(G) + A(G), respectively. Given an n × n matrix M, we denote by φ(M; x) = det(xI n − M), or, simply, φ(M), the characteristic polynomial of M, where I n denotes the identity matrix of size n. In particular, for a graph G, we call φ(A(G)) (respectively, φ(L(G)), φ(Q(G))) the adjacency (respectively, Laplacian, signless Laplacian) characteristic polynomial of G, and we call its roots the adjacency (respectively, Laplacian, signless Laplacian) eigenvalues of G. The collection of eigenvalues of A(G) together with their multiplicities are called the A-spectrum of G. Two graphs are said to be A-cospectral if they have the same A-spectrum. Similar terminology will be used for L(G) and Q(G). So, we obtain the definitions of the L-spectrum, Q-spectrum, L-cospectral graphs, and Q-cospectral graphs. It is known that graph spectra store numerous units of structural information about a graph; see [1][2][3] and the references therein.
Formulating the characteristic polynomials of graphs, as well as calculating the spectra of graphs, is a fundamental and very meaningful work in spectral graph theory. Up until now, the spectra of several graphs have been investigated. For examples, see [1][2][3][4][5][6][7][8][9][10]. It is known that the characteristic polynomials of graphs and the spectra of graphs can enable us to construct infinitely many pairs of A-cospectral (respectively, L-cospectral, Q-cospectral) graphs [7,9,10], as well as to investigate many other properties of graphs, such as the number of spanning trees [1,3], the Kirchhoff index [1,3,[11][12][13], and so on.
In this paper, we investigate the spectra of complemented triangulation graphs of regular graphs, whose definition is given in Definition 1. Our motivation for defining the complemented triangulation graph comes from [14], where the so-called Q-complemented graph was introduced and the adjacency characteristic polynomial of the Q-complemented graph of a graph was computed. Definition 1. 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.
Let C n denote the cycle on n vertices. Figure 1 depicts the complemented triangulation graph of C 4 . In our work, we first obtain the A-spectra, the L-spectra, and the Q-spectra of 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.

Spectra of Complemented Triangulation Graphs
Before proceeding to the presentation of the main results of this section, we need to state some basic results that will be used frequently later.
Let G be a graph with the vertex set V(G) = {v 1 , . . . , v n } and the edge set E(G) = {e 1 , . . . , e m }. The (vertex-edge) incidence matrix of G, denoted by R G = (r ij ), is an n × m matrix with entry r ij = 1 if the vertex v i is incident the edge e j , and r ij = 0 otherwise. It is well known [3] that, if G is an r-regular graph, then where R G represents the transpose of R G . The M-coronal Γ M (x) of an n × n matrix M is defined [4,15] as the sum of the entries of the matrix (xI n − M) −1 , that is, where 1 n denotes the column vector of dimension n with all of the components equal to one. It is known [4] (Proposition 2) that, if M is an n × n matrix with each row sum equal to a constant t, then In particular, since, for any graph G with n vertices, each row sum of L(G) is equal to 0, we have Lemma 1 (see [10]). Let A be an n × n real matrix, α a real number, and J n×n the n × n matrix with all entries equal to one. Then, Lemma 2 (see [16]). Let M 1 , M 2 , M 3 , and M 4 be, respectively, p × p, p × q, q × p, and q × q matrices, where M 1 and M 4 are invertible. Then, are called the Schur complements of M 4 and M 1 , respectively.

A-Spectra of Complemented Triangulation Graphs
Theorem 1. Let G be an r-regular connected graph with n vertices, m edges, and r ≥ 2. Suppose that r = λ 1 ≥ λ 2 ≥ · · · ≥ λ n are the adjacency eigenvalues of G. Then, the adjacency eigenvalues of CT (G) are stated as follows: (a) 0, repeated m − n times; Proof. Note that the adjacency matrix of CT (G) is given by where J n×m denotes the n × m matrix with all entries equal to one. Then, the adjacency characteristic polynomial of CT (G) is given by is the Schur complement of xI m obtained by Lemma 2. Note (1) that R G R G = rI n + A G . Then, we have By Lemma 1 and (2), we have Then, the required result follows from φ A CT (G) ; x = x m · det(S). This completes the proof.
Proof. Note that the Laplacian matrix of CT (G) is given by where J n×m denotes the n × m matrix with all entries equal to one. Thus, the Laplacian characteristic polynomial of CT (G) is given by is the Schur complement of (x + 2 − n)I m obtained by Lemma 2. Note (1) that R G R G = 2rI n − L G . Then, we have Then, the required result follows from φ L CT (G) ; x = (x + 2 − n) m · det(S) and the fact that 2m = rn. This completes the proof.
Proof. Note that the signless Laplacian matrix of CT (G) is given by where I n denotes the identity matrix of size n, and J n×m denotes the n × m matrix with all entries equal to one. Thus, the signless Laplacian characteristic polynomial of CT (G) is given by is the Schur complement of (x + 2 − n)I m obtained by Lemma 2. Note (1) that R G R G = Q G . Then, we have By Lemma 1 and (2), we have det(S) Then, the required result follows from φ Q CT (G) ; x = (x + 2 − n) m · det(S) and the fact that 2m = rn. This completes the proof.

Constructing Cospectral Graphs
It is known that, by using graph operations, we can construct many infinite families of pairs of A-cospectral (respectively, L-cospectral, Q-cospectral) graphs. For example, see [7,9,15]. Here, we use complemented triangulation graphs to construct infinitely many pairs of A-cospectral (respectively, L-cospectral, Q-cospectral) graphs. The following constructions follow from Theorems 1-3. Recall that two graphs are said to be A-cospectral (respectively, L-cospectral, Q-cospectral) if they have the same A-spectrum (respectively, L-spectrum, Q-spectrum).

Corollary 1. (a)
If G 1 and G 2 are A-cospectral regular graphs, then CT (G 1 ) and CT (G 2 ) are A-cospectral graphs. (b) If G 1 and G 2 are L-cospectral regular graphs, then CT (G 1 ) and CT (G 2 ) are L-cospectral graphs. (c) If G 1 and G 2 are Q-cospectral regular graphs, then CT (G 1 ) and CT (G 2 ) are Q-cospectral graphs.

The Number of Spanning Trees
A spanning tree of a graph G is a subgraph that is a tree that includes all of the vertices of G [2]. Let t(G) denote the number of spanning trees of G. It is known [2] that, if G is a connected graph on n vertices with the Laplacian spectrum µ 1 (G) ≥ µ 2 (G) ≥ · · · > µ n (G) = 0, then Here, we give the number of the spanning trees of CT (G) for an r-regular graph G.

Corollary 2.
Let G be an r-regular graph on n vertices and m edges. Suppose that µ 1 ≥ µ 2 ≥ · · · ≥ µ n = 0 are the Laplacian eigenvalues of G. Then, Proof. By Theorem 2, we define for i = 1, 2, . . . , n − 1. One can easily verify that Therefore, t(CT (G)) is obtained by the definition of the number of spanning trees of a graph.

The Kirchhoff Index
The Kirchhoff index of a graph G, denoted by Kf(G), is defined as the sum of the resistance distances between all pairs of vertices [18,19]. At almost exactly the same time, Gutman et al. [20] and Zhu et al. [21] proved that the Kirchhoff index of a connected graph G with n (n ≥ 2) vertices can be expressed as where µ 1 (G), . . . , µ n−1 (G) are the non-zero Laplacian eigenvalues of G. By Theorem 2, we obtain the Kirchhoff index of CT (G) for an r-regular graph G.

Corollary 3.
Let G be an r-regular graph on n vertices and m edges. Suppose that µ 1 ≥ µ 2 ≥ · · · ≥ µ n = 0 are the Laplacian eigenvalues of G. Then, Proof. By Theorem 2, we define for i = 1, 2, . . . , n − 1. One can easily verify that Thus, Kf(CT (G)) is obtained by the definition of the Kirchhoff index of a graph.

Conclusions
Computing the spectra of graphs is an important and interesting work in spectral graph theory. In this paper, we determined the spectra of complemented triangulation graphs of regular graphs. As applications, we constructed infinitely many pairs of cospectral graphs. We also calculated the number of spanning trees and the Kirchhoff index of complemented triangulation graphs. We are sure that the methods used in this paper can also be applied to other graphs, and any attempts on other graphs should be welcome.