The Normalized Laplacians on Both Two Iterated Constructions Associated with Graph and Their Applications ()
            
            
        
                 
1. Introduction
Graph matrices, such as adjacency, incident, Laplacian and normalized Laplacian matrices, can well describe the structure and complex dynamic informations of complex networks. The eigenvalues and eigenvectors of these matrices represent some significant physical or chemical properties of networks. Recently, the normalized Laplacian has been a research hotpot, due to the consistency of eigenvalues in spectral geometry and random processes. Moreover, iteratively constructed graphs are very common in complex networks. Therefore, how to characterize the normalized Laplacian spectrum of such graphs is still a question worthy of study.
Let 
  be a simple connected graph. 
  and 
  are called the order and the size of G, respectively. The adjacency matrix of G, denoted by 
 , is an 
  matrix with the 
  -entry equals to 1 if vertices 
  and 
  are adjacent ( 
  ) and 0 otherwise. Let 
  be the diagonal matrix of vertex degrees, where 
  is the degree of 
  for 
 . The matrix 
  is called the (combinational) Laplacian matrix of G. Recent research on Laplace spectrum one can refer to [1] [2].
In 2007, Chen and Zhang [3] introduced a new resistance distance-based parameter, named the multiplicative degree-Kirchhoff index, defined as 
 . The multiplicative degree-Kirchhoff index is closely related to the normalized Laplacian matrix 
 , which is defined as
  (If the degree of 
  in graph G is equal to 0, then 
  [4]. It’s easy to know that
  (1.1)
Let 
  be the spectrum of 
  with 
 . Let 
  be the multiplicity of eigenvalue 
  of 
 . If G is a connected graph, it is easy to conclude that 
  and 
  for 
 , and the explicit formula of multiplicative degree-Kirchhoff index of G can be written by [3]
  (1.2)
Hunter (2014) [5] studied the Kemeny’s constant of G, which is denoted by 
 . The Kemmeny’s constant provides an interesting quantity for finite ergodic Markov chains and can be given by
  (1.3)
In recent years, more and more researchers have been devoted to studying the normalized Laplacian spectra. Relevant research results on normalized Laplacian and multiplicative degree-Kirchhoff index one may refer to [6]-[11].
Now we consider two iterated constructions associated with G: 
  append k 3-cycles 
  ( 
  ) parallel with each edge 
  of G, and then adding in edges 
  an 
 , while 
  appends k 4-cycles 
  ( 
  ) parallel with each edge 
 , and then adding in edges 
  and 
 . Two iterative graphs are shown in Figure 1.
Motivated by [7] [10], in this paper, we completely obtain the normalized Laplacian spectrum of 
  and 
 , respectively, where 
 . As applications, we derive the closed-formula of the multiplicative degree-Kirchhoff index, the Kemeny’s constant, and the number of spanning trees of 
 ,
 , r-iterative graph 
 , and r-iterative graph 
 , where 
  and 
 .
2. Main Results
In this section, we will give the main conclusions of this paper.
Theorem 2.1. Let G be a simple connected graph with n vertices and m edges. Then the normalized Laplacian eigenvalues of 
  ( 
  ) can be obtained as following:
(i) If 
  is an eigenvalue of 
  such that 
 , then 
  and 
  are the eigenvalues of 
  with 
 , where 
 ,
 ,
  and 
  are roots of
 
(ii) 0, 
  and 
  are the eigenvalues of 
  with multiplicity 1.
(iii) 
  and 
  are the eigenvalues of 
  with multiplicity 1 if G is bipartite and 0 otherwise.
(iv) If G is non-bipartite, then 
  has eigenvalues 
  with multiplicity 
 ,
  with multiplicity 
  and 
  with multiplicity 
 .
(v) If G is bipartite, then 
  has eigenvalues 
  with multiplicity
 ![]()
 Figure 1. Graph 
   and 
  .
 
 ,
  with multiplicity 
  and 
  with multiplicity 
 .
Theorem 2.2. Let G be a simple connected graph with n vertices and m edges. Then the normalized Laplacian eigenvalues of 
  ( 
  ) can be obtained as following:
(i) If 
  is an eigenvalue of 
  such that 
 , then 
 ,
 ,
  and 
  are the eigenvalues of 
  with 
 , where 
 ,
 ,
  and 
  are roots of
 .
(ii) 0, 
  and 
  are the eigenvalues of 
  with multiplicity 1.
(iii) 
  and 
  are the eigenvalues of 
  with multiplicity 1 if G is bipartite and 0 otherwise.
(iv) If G is non-bipartite, then 
  has eigenvalues 
  with multiplicity 
 ,
  with multiplicity 
  and 1 with multiplicity 
 .
(v) If G is bipartite, then 
  has eigenvalues 
  with multiplicity 
 ,
  with multiplicity 
  and 1 with multiplicity 
 .
3. Preliminaries
Before you begin to format your paper, first write and save the content as a separate text file. Let G be a connected graph with n vertices and m edges, the order of 
  is 
  and its size is 
 . Similarly, the order of 
  is 
  and its size is 
 . Let
 
be all the normalized Laplacian eigenvalues of G, 
  and 
 , respectively.
The incident matrix 
  of G is an 
  matrix 
  with the 
  -entry equals to 1 if the vertex 
  and the edge 
  are incident in G and 0 otherwise, The rank of incident matrix 
  is written by 
 . Then we have the following lemma.
Lemma 3.1. [12] Let G be a simple connected graph with n vertices, then
 
If G is a connected oriented graph, the directed incident matrix of G, called 
 , is an 
  matrix. The rank of the directed incident matrix 
  satisfies the following lemma.
Lemma 3.2. [13] Let G be a simple connected graph with n vertices. Then
 
The following lemmas provide the calculation formula of the multiplicative degree-Kirhhoff index, the Kemeny’s constant and the number of spanning trees of graph G, based on the normalized Laplacian spectrum.
Lemma 3.3. [4] Let G be a graph with n vertices and m edges.
(i) 
  with 
  if and only if G is bipartite.
(ii) G is bipartite if and only if the eigenvalues of 
  are symmetric with respect to 1.
(iii) 
 , where 
  is the number of spanning trees of G.
Lemma 3.4. [3] If G is a n-vertices graph of size m. Then
 .
Lemma 3.5. [14] Let G be a simple connected graph with n vertices and m edges, then we have
 
Lemma 3.6. Let 
  be an eigenvalue of 
  such that 
 . Then
  (3.1)
is an eigenvalue of 
  with the same multiplicity as that of 
 .
Proof. Let 
  and 
 , where V is a set of common vertices of G and 
  (i.e. 
  ), and F is the rest vertices of 
 . For each edge 
 , k 3-cycles are added between the vertices u, v. Denote these 3-cycles by 
 . Let 
  ( 
  ). We have
 
Denote the degree of vertex w in 
  by 
 , then
  (3.2)
Let 
  be an eigenvector with respect to the eigenvalue 
  of 
 . According to the characteristic equation 
 , we can obtain that
  (3.3)
for any vertex 
 .
For any vertex 
 , let 
  be the set of the neighbour of vertex u inherited from G. According to the construction of 
  from G and (3.2) and (3.3), we can get
  (3.4)
Similarly, for any 
 ,
  (3.5)
Analogously, for the vertex 
 ,
  (3.6)
For the vertex 
  which is adjacent to 
 ,
  and 
 ,
  (3.7)
Combining (3.5)-(3.7), we can have
 
 
Then
  (3.8)
Similarly,
  (3.9)
According to (3.8), (3.9), we can get that
 
for any 
 .
Substituting (3.8) into (3.5) yields
  (3.10)
If 
 , then
 .
The eigenvector 
  can be completely decided by 
 , when 
  and
 .
Let 
  and
 ,
then we have
  (3.11)
Then we have 
 . Since k is a integer ( 
  ), combining with (3.11), it is easy to conclude that the above equation does not hold. Thus,
 
Then we can obtain that
  (3.12)
for 
 .
So, 
  is an eigenvalue of 
  and 
  is one of the corresponding eigenvectors. Hence,
 
If
 
then there exists an eigenvector 
  with respect to
 
without a corresponding eigenvector in 
 . Combining the (3.5) and (3.8), we can get
 
This completes the proofs.
Lemma 3.7. Let 
  be an eigenvalue of 
  such that 
 . Then
  (3.13)
is an eigenvalue of 
  with the same multiplicity as that of 
 .
Proof. Let 
  and 
 , where O is a set of all the vertices of inherited from G, and R is the rest vertices of 
 . For each edge 
 , k 4-cycles are added between the vertices 
 . Denote these 4-cycles by 
 .
Then we let 
  ( 
  ). Then we have
 
The degree of vertex u in 
  is denoted by 
 , then
  (3.14)
Suppose 
  is an eigenvector with respect to the eigenvalue 
  of 
 . Based on the characteristic equation 
 , we can obtain
  (3.15)
for any vertex 
 .
For any vertex 
 , let 
  be the set of the neighbour of vertex u inherited from G. According to the structural of 
  from G, (3.14) and (3.15), we can get
  (3.16)
Similarly, for any 
 , we have
  (3.17)
Analogously, for the vertex 
  and 
 ,
  (3.18)
  (3.19)
For the vertices 
  and 
 , it follows
  (3.20)
In view of the formulas (3.18)-(3.19), one can see that 
 , with 
  ; 
 .
Combining (3.17)-(3.20), we can get
  (3.21)
  (3.22)
According to (3.21) and (3.22), we have
 
for any 
 .
Substituting (3.21) into (3.16), then we have
  (3.23)
If 
 , then
 . The eigenvector 
  can be completely decided by 
 , when 
  and 
 .
Let 
  and 
 , which implies that
  (3.24)
Then we have 
 . Since k is a integer ( 
  ), combining (3.24), we can know that the above equation does not hold. Hence 
 .
Then
 . (3.25)
for 
 .
So, 
  is an eigenvalue of 
  and 
  is one of the corresponding eigenvectors. Hence,
 
If the inequality is strictly established, then there exists an eigenvector 
  with respect to 
  without a corresponding eigenvector in 
 . Combining (3.5)-(3.8), it is easy to know that
 
This completes the proofs.
4. Proofs of Theorems 2.1 and 2.2
4.1. Proof of Theorem 2.1
Proof. (i)-(iii) Let 
  be an eigenvalue of 
  with 
 . According to Lemma 3.6, one can see that
  (4.1)
is an eigenvalue of 
  with the same multiplicity as that of 
 . Then we have
  (4.2)
Note that 
  is an eigenvalue of 
 , then we substitute 
  into (4.2) yields 
  and 
 . If G is bipartite, substituting 
  into (4.2) yields 
 
Combining Lemma 3.3, this completes proofs of (i) to (iii).
(iv) Substituting 
  into (3.8) yields
  (4.3)
Since the connected simple graph G is non-bipartite, G contains an odd cycle, written by 
 . By (4.3), we have 
 . Then we can obtain 
  for 
 . It is clear that 
  for all 
 . Combining (3.4)-(3.7), then we can get
  (4.4)
Let 
 , with 
  and 
 , then we have 
 . Let
 .
Note that 
 ,
 . Let 
 , then we have
  (4.5)
According to Lemma 3.1, one can see that 
 . System (4.5) has exactly 
  linearly independent solutions. It is easy to know that 
 . Similarly, substituting 
  into (3.8), we can get 
 . Hence 
  by counting the number of the eigenvalues of 
 .
This completes the proofs of (iv).
(v) Substituting 
  into (3.8) yields that
  (4.6)
Assume 
 . Combining with (3.6), we have
  (4.7)
In view of (3.5) and (4.7), then
  (4.8)
According to (3.4),
  (4.9)
Combining (4.8) and (4.9), then
  (4.10)
Combining (4.8) and (4.10), we have 
 . Since k is a integer, it is easy to obtain that 
 . Therefore, 
  for all 
 . By (3.5) to (3.7), one can see 
  and 
 . The eigenvector 
  associated with 
  can be completely determined by the following equation system:
  (4.11)
Let 
  with 
  and 
 . Suppose
 
Note that 
 ,
 . Let 
 , then we have
  (4.12)
By Lemma 3.1, we know that 
 , system (4.12) has exactly 
  linearly independent solutions. Thus 
 . Suppose 
  and 
 . In view of Lemma 3.3, we have
 
Since 
  and 
  are positive integers, it is obvious that 
 . Then we have 
  by counting the number of the eigenvalues of 
 .
This completes the proofs of Theorem 2.1.
4.2. Proof of Theorem 2.2
Proof. (i)-(iii) Let 
  be an eigenvalue of 
  with 
 . By Lemma 3.7, we have
  (4.13)
is an eigenvalue of 
  with the same multiplicity as that of 
 . Then we have
  (4.14)
Since 0 is an eigenvalue of 
  with multiplicity 1, we substitute 
  into (4.14) yields 
  and 
 . By Lemma 3.3, 
  is an eigenvalue of 
  with multiplicity 1 if G is bipartite. Substituting 
  into (4.14) yields 
 ,
 .
This completes the proofs of (i)-(iii).
(iv) Substituting 
  into (3.21) yields that
  (4.15)
Since the connected simple graph G is non-bipartite, G contains an odd cycle, written as 
 . In view of (4.15), we have 
 . It is easy to conclude that 
  for 
 . Note that G is connected, we have 
  for all 
 . Combining with (3.16) to (3.20), we have 
  and 
 .
Therefore, the eigenvector 
  associated with 
  can be completely decided by the following equation system:
  (4.16)
Suppose 
 , with 
  and 
 . Let
 
Note that 
 ,
 . Let 
 . Then we have
  (4.17)
By Lemma 3.1, we know that 
 . System (4.17) has 
  linearly independent solutions. Thus 
 . Similarly, substitute 
  into (3.21), we can get 
 . Hence 
  by counting the number of the eigenvalues of 
 .
This completes the proofs of (iv).
(v) Substituting 
  into (3.20) yields that
  (4.18)
Suppose 
 . By (3.17) and (3.20), we have
  (4.19)
In view of (3.18), we have that
  (4.20)
By (3.16), it is obvious that
  (4.21)
According to (4.20) and (4.21), we know that
  (4.22)
Combining (4.20) and (4.22), we have 
 . Since k is a integer, it is easy to know that 
 , thus, 
  for all 
 . By (3.17) to (3.20), we have 
  and 
 . The eigenvector 
  associated with 
  can be completely determined by the following equation system
  (4.23)
Suppose 
  and 
 , with 
  and 
 . Let
  (4.24)
Note that 
 , for all 
 . Let 
 . Then we have
 
In view of Lemma 3.1, we know that 
 , system (4.24) has exactly 
  linearly independent solutions. Thus 
 . Let 
  and 
 . By Lemma 3.3, we have
 
Note that 
  and 
  are positive integers, we have 
 . Therefore, 
  by counting the number of the eigenvalues of 
 .
This completes the proofs of Theorem 2.2.
5. Application
5.1. The Normalized Laplacian, Multiplicative Degree-Kirchhoff Index, Kemeny’s Constant and Spanning Trees of 
 
Note that 
 ,
 ,
 . Let 
  and 
  be the size and order of 
 , respectively, where 
  and 
 . Then the following equations system can be obtained.
 .
Thus, we can get the general formula of 
  and 
 ,
 ,
 . (5.1)
The roots of 
  are denoted by 
 , with 
 . Let H be a multiset of real numbers, we have
 
where 
  are defined as above. Then the following theorem directly follows by Theorem 2.1 and the construction of 
 .
Theorem 5.1. Let G be a simple connected graph of order n and size m. Then
 
Theorem 5.2. Let G be a simple connected graph of order n and size m. Then
(i)
 
(ii)
 
(iii)
 
Proof. (i) According to Theorem 2.1 (i), one can see that the four roots of 
  denoted by 
 , are the four corresponding eigenvalues of 
 , when 
 .
By Vieta theorem, we obtain the following equation:
 
  (5.2)
Based on Theorem 2.1, Lemma 3.4, (5.1) and (5.2), we have
 
Based on the above equation and the construction of 
  ( 
  ), we have
 
By simple calculation, the conclusion can be easily drawn.
(ii) In view of Lemma 3.5, Theorem 5.2 (i) and (5.1), we can obtain that
 
Based on the above equation and the construction of 
  ( 
  ), we have
 
By simple calculation, the conclusion can be easily drawn.
(iii) According to Theorem 2.1, Lemma 3.2, and (5.1), one can see
 
From the above equation and the construction of 
  ( 
  ), we have
 
This completes the proofs of Theorem 5.2.
5.2. The Normalized Laplacian, Multiplicative Degree-Kirchhoff Index, Kemeny’s Constant and Spanning Trees of 
 
Note that 
 ,
 ,
 . Let 
  and 
  be the size and order of 
 , respectively, where 
  and 
 . The following equations can be obtained.
 
It follows that
 ,
 . (5.3)
The four roots of 
  are denoted by 
  and 
 , respectively. For a multiset H of for real numbers, we may define four new multiset:
 
Similarly, the following results on the spectrum of 
  ( 
  ) follows immediately by Theorem 2.2 and the construction of 
  from G.
Theorem 5.3. Let G be a simple connected graph of order n and size m. Then
 
Theorem 5.4. Let G be a simple connected graph of order n and size m. Then
(i)
 
(ii)
 
(iii)
 
Proof. (i) By Theorem 2.2, the four corresponding eigenvalues 
  of 
  are roots of 
 
Thus 
  satisfy the following equation:
 
  (5.4)
In view of Theorem 2.2, Lemma 3.3, (5.3) and (5.4), one can see
 
Based on the above equation and the construction of 
  ( 
  ), we have
 
By simple calculation, the conclusion can be easily drawn.
(ii) In view of Lemma 3.5, Theorem 5.4 (i) and (5.4), we obtain that
 
Based on the above equation and the construction of 
  ( 
  ) that
 
By simple calculation, the conclusion can be easily drawn.
(iii) According to Theorem 2.2, Lemma 3.2, (5.3) and (5.4), we can obtain
 
Based on the above equation and the construction of 
  ( 
  ), we have
 
This completes the proofs of Theorem 5.4.