Given a simple connected graph G, we consider two iterated constructions associated with G: F k (G) and R k (G) . In this paper, we completely obtain the normalized Laplacian spectrum of F k (G) and R k (G) , with k ≥2, respectively. As applications, we derive the closed-formula of the multiplicative degree-Kirchhoff index, the Kemeny’s constant, and the number of spanning trees of F k (G) , R k (G) , r-iterative graph , Fr k (G) and r-iterative graph , where k ≥2 and r ≥1 . Our results extend those main results proposed by Pan et al. (2018), and we provide a method to characterize the normalized Laplacian spectrum of iteratively constructed complex graphs.
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 G = ( V ( G ) , E ( G ) ) be a simple connected graph. V ( G ) and E ( G ) are called the order and the size of G, respectively. The adjacency matrix of G, denoted by A ( G ) , is an n × n matrix with the ( i , j ) -entry equals to 1 if vertices v i and v j are adjacent ( v i ∼ v j ) and 0 otherwise. Let D ( G ) = d i a g ( d 1 , d 2 , ⋯ d n ) be the diagonal matrix of vertex degrees, where d v i is the degree of v i ∈ V ( G ) for 1 ≤ i ≤ n . The matrix L ( G ) = D ( G ) − A ( G ) is called the (combinational) Laplacian matrix of G. Recent research on Laplace spectrum one can refer to [
In 2007, Chen and Zhang [
L ( G ) = D ( G ) − 1 2 L ( G ) D ( G ) 1 2 (If the degree of v i in graph G is equal to 0, then ( d v i ) − 1 2 = 0 [
L ( G ) = { 1 , if i = j − 1 d v i d v j , if i ≠ j and v i ∼ v j 0 , otherwise . (1.1)
Let S ( G ) = { λ 1 , λ 2 , ⋯ λ n } be the spectrum of L ( G ) with λ 1 ≤ λ 2 ≤ ⋯ ≤ λ n . Let p L ( G ) ( λ i ) be the multiplicity of eigenvalue λ i of L ( G ) . If G is a connected graph, it is easy to conclude that λ 1 = 0 and λ i > 0 for 2 ≤ i ≤ n , and the explicit formula of multiplicative degree-Kirchhoff index of G can be written by [
K f * ( G ) = 2 | E ( G ) | ∑ i = 2 n 1 λ i (1.2)
Hunter (2014) [
K f * ( G ) = 2 | E ( G ) | K e ( G ) (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 [
Now we consider two iterated constructions associated with G: F k ( G ) append k 3-cycles T i l = u i 1 l u i 2 l u i 3 l u i 1 l ( l = 1 , 2 , ⋯ , k ) parallel with each edge e i = u e i v e i of G, and then adding in edges u e i u i 1 l an v e i u i 4 l , while R k ( G ) appends k 4-cycles Q i l = u i 1 l u i 2 l u i 3 l u i 4 l u i 1 l ( l = 1 , 2 , ⋯ , k ) parallel with each edge e i = u e i v e i , and then adding in edges u e i u i 1 l and v e i u i 4 l . Two iterative graphs are shown in
Motivated by [
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 F k ( G ) ( k ≥ 2 ) can be obtained as following:
(i) If λ is an eigenvalue of L ( G ) such that λ ≠ 0 , 2 , then σ 1 , σ 2 , σ 3 and σ 4 are the eigenvalues of L ( F k ( G ) ) with p L ( F k ( G ) ) ( σ 1 ) = p L ( F k ( G ) ) ( σ 2 ) = p L ( F k ( G ) ) ( σ 3 ) = p L ( F k ( G ) ) ( σ 4 ) = p L ( G ) ( λ ) , where σ 1 , σ 2 , σ 3 and σ 4 are roots of
18 ( k + 1 ) σ 4 − ( 72 k + 18 λ + 54 ) σ 3 + ( 94 k + 54 λ + 46 ) σ 2 − ( 40 k + 46 λ + 2 k λ + 8 ) σ + ( 3 k + 8 ) λ = 0.
(ii) 0, 8 k + 4 k 2 + 8 k + 13 + 5 6 ( k + 1 ) and 8 k − 4 k 2 + 8 k + 13 + 5 6 ( k + 1 ) are the eigenvalues of L ( F k ( G ) ) with multiplicity 1.
(iii) 7 k + 13 k 2 + 8 k + 4 + 10 6 ( k + 1 ) and 7 k − 13 k 2 + 8 k + 4 + 10 6 ( k + 1 ) are the eigenvalues of L ( F k ( G ) ) with multiplicity 1 if G is bipartite and 0 otherwise.
(iv) If G is non-bipartite, then L ( F k ( G ) ) has eigenvalues 5 + 13 6 with multiplicity k m − n , 5 − 13 6 with multiplicity k m − n and 4 3 with multiplicity k m − n + 1 .
(v) If G is bipartite, then L ( F k ( G ) ) has eigenvalues 5 + 13 6 with multiplicity
k m − n + 1 , 5 − 13 6 with multiplicity k m − n + 1 and 4 3 with multiplicity k m − n + 1 .
Theorem 2.2. Let G be a simple connected graph with n vertices and m edges. Then the normalized Laplacian eigenvalues of R k ( G ) ( k ≥ 2 ) can be obtained as following:
(i) If λ is an eigenvalue of L ( G ) such that λ ≠ 0 , 2 , then μ 1 , μ 2 , μ 3 and μ 4 are the eigenvalues of L ( R k ( G ) ) with p L ( R k ( G ) ) ( μ 1 ) = p L ( R k ( G ) ) ( μ 2 ) = p L ( R k ( G ) ) ( μ 3 ) = p L ( R k ( G ) ) ( μ 4 ) = p L ( G ) ( λ ) , where μ 1 , μ 2 , μ 3 and μ 4 are roots of
9 ( k + 1 ) μ 4 − ( 36 k + 9 λ + 27 ) μ 3 + ( 45 k + 27 λ + 21 ) μ 2 − ( 18 k + 21 λ + 3 ) μ + ( k + 3 ) λ = 0 .
(ii) 0, 9 k + 3 3 k 2 + 8 k + 8 + 6 6 ( k + 1 ) and 9 k − 3 3 k 2 + 8 k + 8 + 6 6 ( k + 1 ) are the eigenvalues of L ( R k ( G ) ) with multiplicity 1.
(iii) 6 k + 3 4 k 2 + 4 k + 3 + 9 6 ( k + 1 ) and 6 k − 3 4 k 2 + 4 k + 3 + 9 6 ( k + 1 ) are the eigenvalues of L ( R k ( G ) ) with multiplicity 1 if G is bipartite and 0 otherwise.
(iv) If G is non-bipartite, then L ( R k ( G ) ) has eigenvalues 3 + 6 3 with multiplicity k m − n , 3 − 6 3 with multiplicity k m − n and 1 with multiplicity 2 k m − n + 1 .
(v) If G is bipartite, then L ( R k ( G ) ) has eigenvalues 3 + 6 3 with multiplicity k m − n + 1 , 3 − 6 3 with multiplicity k m − n + 1 and 1 with multiplicity 2 k m − n + 1 .
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 F k ( G ) is n + 3 k m and its size is ( 5 k + 1 ) m . Similarly, the order of R k ( G ) is n + 4 k m and its size is ( 6 k + 1 ) m . Let
0 = λ 1 < λ 2 ≤ ⋯ ≤ λ n , 0 = σ 1 < σ 2 ≤ ⋯ ≤ σ n + 3 k m , 0 = μ 1 < μ 2 ≤ ⋯ ≤ μ n + 4 k m .
be all the normalized Laplacian eigenvalues of G, F k ( G ) and R k ( G ) , respectively.
The incident matrix I ( G ) of G is an n × m matrix ( b i j ) with the ( i , j ) -entry equals to 1 if the vertex v i and the edge e j are incident in G and 0 otherwise, The rank of incident matrix I ( G ) is written by r ( I ( G ) ) . Then we have the following lemma.
Lemma 3.1. [
r ( I ( G ) ) = { n − 1 , if G is bipartite, n , otherwise .
If G is a connected oriented graph, the directed incident matrix of G, called I → ( G ) , is an n × m matrix. The rank of the directed incident matrix I → ( G ) satisfies the following lemma.
Lemma 3.2. [
r ( I → ( G ) ) = n − 1.
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. [
(i) n n − 1 ≤ λ n ≤ 2 with λ n = 2 if and only if G is bipartite.
(ii) G is bipartite if and only if the eigenvalues of L ( G ) are symmetric with respect to 1.
(iii) ∏ i = 1 n d i ∏ k = 2 n λ k = 2 m τ ( G ) , where τ ( G ) is the number of spanning trees of G.
Lemma 3.4. [
K f * ( G ) = 2 m ∑ i = 2 n 1 λ i .
Lemma 3.5. [
K e ( G ) = ∑ i = 2 ( 1 / λ i ) , K f * ( G ) = 2 m K e ( G ) .
Lemma 3.6. Let σ be an eigenvalue of L ( F k ( G ) ) such that σ ≠ 4 3 , 5 ± 13 6 . Then
σ [ 18 ( k + 1 ) σ 3 − ( 72 k + 54 ) σ 2 + ( 94 k + 46 ) σ − ( 40 k + 8 ) ] 18 σ 3 − 54 σ 2 + ( 46 + 2 k ) σ − ( 3 k + 8 ) (3.1)
is an eigenvalue of L ( G ) with the same multiplicity as that of σ .
Proof. Let E ( G ) = { e 1 , e 2 , ⋯ , e m } and V ( F k ( G ) ) = V ∪ F , where V is a set of common vertices of G and F k ( G ) (i.e. V = V ( G ) ∩ V ( F k ( G ) ) ), and F is the rest vertices of V ( F k ( G ) ) . For each edge e i = u v ∈ E ( G ) , k 3-cycles are added between the vertices u, v. Denote these 3-cycles by T i l = u i 1 l u i 2 l u i 3 l u i 1 l . Let F j l = { u 1 j l , u 2 j l , ⋯ , u m j l } ( j = 1 , 2 , 3 ; l = 1 , 2 , ⋯ , k ). We have
F = ∪ l = 1 k ∪ j = 1 3 F j l
Denote the degree of vertex w in F k ( G ) by d w ' , then
d w ' = { ( k + 1 ) d w , w ∈ V 3 , w ∈ F 1 ∪ F 3 2 , w ∈ F 2 (3.2)
Let x = ( x 1 , x 2 , ⋯ , x n + 3 k m ) t be an eigenvector with respect to the eigenvalue σ of L ( F k ( G ) ) . According to the characteristic equation L ( F k ( G ) ) x = σ x , we can obtain that
( 1 − σ ) x w = ∑ v ∼ w 1 d v ' d w ' x v (3.3)
for any vertex w ∈ V ( F k ( G ) ) .
For any vertex u ∈ V , let N G ( u ) be the set of the neighbour of vertex u inherited from G. According to the construction of F k ( G ) from G and (3.2) and (3.3), we can get
( 1 − σ ) x u = ∑ l = 1 k ∑ u i 1 l ∈ F 1 l ( u ) 1 d u i 1 l ' d u ' x u i 1 l + ∑ v ∈ N G ( u ) 1 d u ' d v ' x v = ∑ l = 1 k ∑ u i 1 l ∈ F 1 l ( u ) 1 3 ( k + 1 ) d u x u i 1 l + ∑ v ∈ N G ( u ) 1 ( k + 1 ) d u d v x v . (3.4)
Similarly, for any u i 1 l ∈ F 1 l ,
( 1 − σ ) x u i 1 l = 1 d u i 1 l ' d u i 2 l ' x u i 2 l + 1 d u i 1 l ' d u i 3 l ' x u i 3 l + 1 d u i 1 l ' d u ' x u = 1 6 x u i 1 l + 1 3 x u i 3 l + 1 3 ( k + 1 ) d u x u . (3.5)
Analogously, for the vertex u i 2 l ∈ F 2 l ,
( 1 − σ ) x u i 2 l = 1 d u i 1 l ' d u i 2 l ' x u i 1 l + 1 d u i 2 l ' d u i 3 l ' x u i 3 l = 1 6 x u i 1 l + 1 6 x u i 3 l . (3.6)
For the vertex u i 3 l which is adjacent to u i 1 l , u i 3 l ∈ V ( T i l ) and v ∈ N G ( u ) ,
( 1 − σ ) x u i 3 l = 1 d u i 1 l ' d u i 3 l ' x u i 1 l + 1 d u i 2 l ' d u i 3 l ' x u i 2 l + 1 d u i 3 l ' d v ' x v = 1 6 x u i 2 l + 1 3 x u i 3 l + 1 3 ( k + 1 ) d v x v . (3.7)
Combining (3.5)-(3.7), we can have
[ ( 1 − σ ) 2 − 1 6 ] x u i 1 l = 1 − σ 3 ( k + 1 ) d u x u + 3 − 2 σ 6 x u i 3 l ,
[ ( 1 − σ ) 2 − 1 6 ] x u i 3 l = 3 − 2 σ 3 ( k + 1 ) d u x u + 1 − σ 6 x u i 1 l .
Then
2 ( 4 − 3 σ ) ( 3 σ 2 − 5 σ + 1 ) x u i 1 l = 3 ( 6 σ 2 − 12 σ + 5 ) 3 ( k + 1 ) d u x u + 3 ( 3 − 2 σ ) 3 ( k + 1 ) d v x v , (3.8)
Similarly,
2 ( 4 − 3 σ ) ( 3 σ 2 − 5 σ + 1 ) x u i 3 l = 3 ( 3 − 2 σ ) 3 ( k + 1 ) d u x u + 3 ( 6 σ 2 − 12 σ + 5 ) 3 ( k + 1 ) d v x v . (3.9)
According to (3.8), (3.9), we can get that
x u i 1 1 = x u i 1 2 = ⋯ = x u i 1 k , x u i 3 1 = x u i 3 2 = ⋯ = x u i 3 k .
for any σ ≠ 4 3 , 5 ± 13 6 .
Substituting (3.8) into (3.5) yields
2 ( 1 − σ ) ( 4 − 3 σ ) ( 3 σ 2 − 5 σ + 1 ) x u = k ( 6 σ 2 − 12 σ + 5 ) ( k + 1 ) x u + k ( 3 − 2 σ ) + 2 ( 4 − 3 σ ) ( 3 σ 2 − 5 σ + 1 ) k + 1 ∑ v ∈ N G ( u ) 1 d u d v x v . (3.10)
If k ( 3 − 2 σ ) + 2 ( 4 − 3 σ ) ( 3 σ 2 − 5 σ + 1 ) = 0 , then
[ 2 ( k + 1 ) ( 1 − σ ) ( 4 − 3 σ ) ( 3 σ 2 − 5 σ + 1 ) − k ( 6 σ 2 − 12 σ + 5 ) ] x u = 0 .
The eigenvector x can be completely decided by x 0 = ( x u ) u ∈ V t , when σ ≠ 4 3 , 5 ± 13 6 and
[ 2 ( k + 1 ) ( 1 − σ ) ( 4 − 3 σ ) ( 3 σ 2 − 5 σ + 1 ) − k ( 6 σ 2 − 12 σ + 5 ) ] x u ≠ 0 .
Let k ( 3 − 2 σ ) + 2 ( 4 − 3 σ ) ( 3 σ 2 − 5 σ + 1 ) = 0 and
[ 2 ( k + 1 ) ( 1 − σ ) ( 4 − 3 σ ) ( 3 σ 2 − 5 σ + 1 ) − k ( 6 σ 2 − 12 σ + 5 ) ] x u = 0 ,
then we have
k = − 2 ( 4 − σ ) ( 3 σ 2 − 5 σ + 1 ) 3 − 2 σ = − 8 σ 2 − 17 σ + 8 ( 3 − 2 σ ) ( 1 − σ ) . (3.11)
Then we have σ ( 18 σ 3 − 17 σ 2 + 92 σ − 37 ) = 0 . Since k is a integer ( k ≥ 2 ), combining with (3.11), it is easy to conclude that the above equation does not hold. Thus,
k ( 3 − 2 σ ) + 2 ( 4 − 3 σ ) ( 3 σ 2 − 5 σ + 1 ) ≠ 0.
Then we can obtain that
{ 1 − σ [ 18 ( k + 1 ) σ 3 − ( 72 k + 54 ) σ 2 + ( 94 k + 46 ) σ − ( 40 k + 8 ) ] 18 σ 3 − 54 σ 2 + ( 46 + 2 k ) σ − ( 3 k + 8 ) } x u = ∑ v ∈ N G ( u ) 1 d u d v x v (3.12)
for σ ≠ 4 3 , 5 ± 13 6 .
So, σ [ 18 ( k + 1 ) σ 3 − ( 72 k + 54 ) σ 2 + ( 94 k + 46 ) σ − ( 40 k + 8 ) ] 18 σ 3 − 54 σ 2 + ( 46 + 2 k ) σ − ( 3 k + 8 ) is an eigenvalue of L ( G ) and x 0 = ( x u ) u ∈ V t is one of the corresponding eigenvectors. Hence,
p L ( G ) ( σ [ 18 ( k + 1 ) σ 3 − ( 72 k + 54 ) σ 2 + ( 94 k + 46 ) σ − ( 40 k + 8 ) ] 18 σ 3 − 54 σ 2 + ( 46 + 2 k ) σ − ( 3 k + 8 ) ) ≥ p L ( F k ( G ) ) ( σ ) .
If
p L ( G ) ( σ [ 18 ( k + 1 ) σ 3 − ( 72 k + 54 ) σ 2 + ( 94 k + 46 ) σ − ( 40 k + 8 ) ] 18 σ 3 − 54 σ 2 + ( 46 + 2 k ) σ − ( 3 k + 8 ) ) > p L ( F k ( G ) ) ( σ ) ,
then there exists an eigenvector x 0 ' with respect to
σ [ 18 ( k + 1 ) σ 3 − ( 72 k + 54 ) σ 2 + ( 94 k + 46 ) σ − ( 40 k + 8 ) ] 18 σ 3 − 54 σ 2 + ( 46 + 2 k ) σ − ( 3 k + 8 )
without a corresponding eigenvector in L ( F k ( G ) ) . Combining the (3.5) and (3.8), we can get
p L ( G ) ( σ [ 18 ( k + 1 ) σ 3 − ( 72 k + 54 ) σ 2 + ( 94 k + 46 ) σ − ( 40 k + 8 ) ] 18 σ 3 − 54 σ 2 + ( 46 + 2 k ) σ − ( 3 k + 8 ) ) = p L ( F k ( G ) ) ( σ ) .
This completes the proofs.
Lemma 3.7. Let μ be an eigenvalue of L ( R k ( G ) ) such that μ ≠ 1 , 3 ± 6 3 . Then
3 μ [ 3 ( k + 1 ) μ 3 − ( 12 k + 9 ) μ 2 + ( 15 k + 7 ) μ − ( 6 k + 1 ) ] 9 μ 3 − 27 μ 2 + 21 μ − ( k + 3 ) (3.13)
is an eigenvalue of L ( G ) with the same multiplicity as that of μ .
Proof. Let E ( G ) = { e 1 , e 2 , ⋯ , e m } and V ( R k ( G ) ) = O ∪ R , where O is a set of all the vertices of inherited from G, and R is the rest vertices of V ( R k ( G ) ) . For each edge e i = u v ∈ E ( G ) , k 4-cycles are added between the vertices u , v . Denote these 4-cycles by Q i l = u i 1 l u i 2 l u i 3 l u i 4 l u i 1 l .
Then we let R j l = { u 1 j l , u 2 j l , ⋯ , u m j l } ( j = 1 , 2 , 3 , 4 ; l = 1 , 2 , ⋯ , k ). Then we have
R = ∪ l = 1 k ∪ j = 1 4 R j l .
The degree of vertex u in R k ( G ) is denoted by d u ' , then
d u ' = { ( k + 1 ) d u , u ∈ O 3 , u ∈ R 1 ∪ R 4 2 , u ∈ R 2 . (3.14)
Suppose x 0 = ( x 1 , x 2 , ⋯ , x n + 4 m ) t is an eigenvector with respect to the eigenvalue μ of L ( R k ( G ) ) . Based on the characteristic equation L ( R k ( G ) ) x = μ x , we can obtain
( 1 − μ ) x u = ∑ v ∼ u 1 d v ' d u ' x v (3.15)
for any vertex u ∈ V ( R k ( G ) ) .
For any vertex u ∈ O , let N G ( u ) be the set of the neighbour of vertex u inherited from G. According to the structural of R k ( G ) from G, (3.14) and (3.15), we can get
( 1 − μ ) = ∑ l = 1 k ∑ u i 1 l ∈ R 1 l 1 d u i 1 l ' d u ' x u i 1 l + ∑ v ∈ N G ( u ) 1 d u ' d v ' x v = ∑ l = 1 k ∑ u i 1 l ∈ R 1 l 1 3 ( k + 1 ) d u x u i 1 l + ∑ v ∈ N G ( u ) 1 ( k + 1 ) d u d v x v . (3.16)
Similarly, for any u i 1 l ∈ R 1 l , we have
( 1 − μ ) x u i 1 l = 1 d u i 1 l ' d u i 2 l ' x u i 2 l + 1 d u i 1 l ' d u i 3 l ' x u i 3 l + 1 d u i 1 l ' d u ' x u = 1 6 x u i 1 l + 1 6 x u i 3 l + 1 3 ( k + 1 ) d u x u . (3.17)
Analogously, for the vertex u i 2 l ∈ R 2 l and u i 3 l ∈ R 3 l ,
( 1 − μ ) x u i 2 l = 1 d u i 1 l ' d u i 2 l ' x u i 1 l + 1 d u i 4 l ' d u i 2 l ' x u i 4 l = 1 6 x u i 1 l + 1 6 x u i 4 l , (3.18)
( 1 − μ ) x u i 3 l = 1 d u i 1 l ' d u i 3 l ' x u i 1 l + 1 d u i 4 l ' d u i 3 l ' x u i 4 l = 1 6 x u i 1 l + 1 6 x u i 4 l . (3.19)
For the vertices u i 4 l ∈ R 4 l and v ∈ N G ( u ) , it follows
( 1 − μ ) x u i 4 l = 1 d u i 4 l ' d u i 2 l ' x u i 2 l + 1 d u i 4 l ' d u i 3 l ' x u i 3 l + 1 d u i 4 l ' d v ' x v = 1 6 x u i 1 l + 1 6 x u i 3 l + 1 3 ( k + 1 ) d v x v . (3.20)
In view of the formulas (3.18)-(3.19), one can see that x u i 2 l = x u i 3 l , with i = 1 , 2 , ⋯ , m ; l = 1 , 2 , ⋯ , k .
Combining (3.17)-(3.20), we can get
( 1 − μ ) ( 3 μ 2 − 6 μ + 1 ) x u i 1 l = ( 3 μ 2 − 6 μ + 2 ) 3 ( k + 1 ) d u x u + 1 3 ( k + 1 ) d v x v , (3.21)
( 1 − μ ) ( 3 μ 2 − 6 μ + 1 ) x u i 4 l = 1 3 ( k + 1 ) d u x u + ( 3 μ 2 − 6 μ + 2 ) 3 ( k + 1 ) d v x v . (3.22)
According to (3.21) and (3.22), we have
x u i 1 1 = x u i 1 2 = ⋯ = x u i 1 k , x u i 4 1 = x u i 4 2 = ⋯ = x u i 4 k .
for any μ ≠ 1 , 3 ± 6 3 .
Substituting (3.21) into (3.16), then we have
[ ( 1 − μ ) 2 ( 3 μ 2 − 6 μ + 1 ) ] x u = k ( 3 μ 2 − 6 μ + 2 ) 3 ( k + 1 ) x u + k + 3 ( 1 − μ ) ( 3 μ 2 − 6 μ + 1 ) 3 ( k + 1 ) ∑ v ∈ N G ( u ) 1 d u d v x v . (3.23)
If k + 3 ( 1 − μ ) ( 3 μ 2 − 6 μ + 1 ) = 0 , then
[ 3 ( k + 1 ) ( 1 − μ ) 2 ( 3 μ 2 − 6 μ + 1 ) − k ( 3 μ 2 − 6 μ + 2 ) ] x u = 0 . The eigenvector x can be completely decided by x 0 = ( x u ) u ∈ O t , when μ ≠ 1 , 3 ± 6 3 and 3 ( k + 1 ) ( 1 − μ ) 2 ( 3 μ 2 − 6 μ + 1 ) − k ( 3 μ 2 − 6 μ + 2 ) ≠ 0 .
Let k + 3 ( 1 − μ ) ( 3 μ 2 − 6 μ + 1 ) = 0 and 3 ( k + 1 ) ( 1 − μ ) 2 ( 3 μ 2 − 6 μ + 1 ) − k ( 3 μ 2 − 6 μ + 2 ) = 0 , which implies that
k = 3 μ 2 − 7 μ + 3 μ − 1 = 3 ( μ − 1 ) ( 3 μ 2 − 6 μ + 1 ) . (3.24)
Then we have μ ( 9 μ 3 − 36 μ 2 + 45 μ − 17 ) = 0 . Since k is a integer ( k ≥ 2 ), combining (3.24), we can know that the above equation does not hold. Hence k + 3 ( 1 − μ ) ( 3 μ 2 − 6 μ + 1 ) ≠ 0 .
Then
{ 1 − 3 μ [ 3 ( k + 1 ) μ 3 − ( 12 k + 9 ) μ 2 + ( 15 k + 7 ) μ − ( 6 k + 1 ) ] 9 μ 3 − 27 μ 2 + 21 μ − ( k + 3 ) } x u = ∑ v ∈ N G ( u ) 1 d u d v x v . (3.25)
for μ ≠ 1 , 3 ± 6 3 .
So, 3 μ [ 3 ( k + 1 ) μ 3 − ( 12 k + 9 ) μ 2 + ( 15 k + 7 ) μ − ( 6 k + 1 ) ] 9 μ 3 − 27 μ 2 + 21 μ − ( k + 3 ) is an eigenvalue of L ( G ) and x 0 = ( x u ) u ∈ O t is one of the corresponding eigenvectors. Hence,
p L ( G ) ( 3 μ [ 3 ( k + 1 ) μ 3 − ( 12 k + 9 ) μ 2 + ( 15 k + 7 ) μ − ( 6 k + 1 ) ] 9 μ 3 − 27 μ 2 + 21 μ − ( k + 3 ) ) ≥ p L ( R k ( G ) ) ( μ ) .
If the inequality is strictly established, then there exists an eigenvector x 0 ' with respect to 3 μ [ 3 ( k + 1 ) μ 3 − ( 12 k + 9 ) μ 2 + ( 15 k + 7 ) μ − ( 6 k + 1 ) ] 9 μ 3 − 27 μ 2 + 21 μ − ( k + 3 ) without a corresponding eigenvector in L ( R k ( G ) ) . Combining (3.5)-(3.8), it is easy to know that
p L ( G ) ( 3 μ [ 3 ( k + 1 ) μ 3 − ( 12 k + 9 ) μ 2 + ( 15 k + 7 ) μ − ( 6 k + 1 ) ] 9 μ 3 − 27 μ 2 + 21 μ − ( k + 3 ) ) = p L ( R k ( G ) ) ( μ ) .
This completes the proofs.
Proof. (i)-(iii) Let σ be an eigenvalue of L ( F k ( G ) ) with σ ≠ 4 3 , 5 ± 13 6 . According to Lemma 3.6, one can see that
λ = σ [ 18 ( k + 1 ) σ 3 − ( 72 k + 54 ) σ 2 + ( 94 k + 46 ) σ − ( 40 k + 8 ) ] 18 σ 3 − 54 σ 2 + ( 46 + 2 k ) σ − ( 3 k + 8 ) (4.1)
is an eigenvalue of L ( G ) with the same multiplicity as that of σ . Then we have
18 ( k + 1 ) σ 4 − ( 72 k + 18 λ + 54 ) σ 3 + ( 94 k + 54 λ + 46 ) σ 2 − ( 40 k + 46 λ + 2 k λ + 8 ) σ + ( 3 k + 8 ) λ = 0. (4.2)
Note that λ 1 = 0 is an eigenvalue of L ( G ) , then we substitute λ = 0 into (4.2) yields σ = 0 , 4 3 and 8 k ± 4 k 2 + 8 k + 13 + 5 6 ( k + 1 ) . If G is bipartite, substituting λ = 2 into (4.2) yields σ = 5 ± 13 6 , 7 k + 13 k 2 + 8 k + 4 + 10 6 ( k + 1 ) .
Combining Lemma 3.3, this completes proofs of (i) to (iii).
(iv) Substituting σ = 5 − 13 6 into (3.8) yields
1 d u x u = − 1 d v x v . (4.3)
Since the connected simple graph G is non-bipartite, G contains an odd cycle, written by C 0 . By (4.3), we have x u d u = ( − 1 ) | V ( C 0 ) | x u d u = − x u d u . Then we can obtain x u = x v = 0 for u ∼ v . It is clear that x u = 0 for all u ∈ V ( G ) . Combining (3.4)-(3.7), then we can get
{ x u i 1 l = x u i 3 l , ∀ u i 1 l ∈ F 1 l , ∀ u i 3 l ∈ F 3 l x u i 2 l = 78 − 6 6 x u i 1 l , ∀ u i 2 l ∈ F 2 l x u = 0 , ∀ u ∈ V ∑ l = 1 k ∑ u i 1 l ∈ F 1 u 1 3 ( k + 1 ) d u x u i 1 l = 0 , ∀ u ∈ V (4.4)
Let x u i 1 l = x u i 3 l = y i l , with i = 1 , 2 , ⋯ , m and l = 1 , 2 , ⋯ , k , then we have x u i 2 l = 78 − 6 6 y i l . Let
y = ( y 1 1 , y 2 1 , ⋯ , y m 1 , ⋯ , y 1 k , y 2 k , ⋯ , y m k ) k m t .
Note that ∑ l = 1 k ∑ u i 1 l ∈ F 1 u 1 3 ( k + 1 ) d u x u i 1 l = 0 , ∀ u ∈ V . Let W ( G ) = [ I ( G ) , I ( G ) , ⋯ , I ( G ) ] n × k m , then we have
W ( G ) y = 0. (4.5)
According to Lemma 3.1, one can see that r ( W ( G ) ) = r ( I ( G ) ) = n . System (4.5) has exactly k m − n + 1 linearly independent solutions. It is easy to know that p L ( F k ( G ) ) ( 5 − 13 6 ) = k m − n . Similarly, substituting σ = 5 + 13 6 into (3.8), we can get p L ( F k ( G ) ) ( 5 + 13 6 ) = k m − n . Hence p L ( F k ( G ) ) ( 4 3 ) = k m − n + 1 by counting the number of the eigenvalues of F k ( G ) .
This completes the proofs of (iv).
(v) Substituting σ = 4 3 into (3.8) yields that
x u d u = x v d v . (4.6)
Assume x u d u = x v d v = t . Combining with (3.6), we have
x u i 2 l = − 6 2 ( x u i 1 l + x u i 3 l ) . (4.7)
In view of (3.5) and (4.7), then
x u i 1 l + x u i 3 l = 12 k + 1 ⋅ t (4.8)
According to (3.4),
∑ l = 1 k ∑ u i 1 l ∈ F 1 l x u i 1 l = − k + 4 3 ( k + 1 ) d u t . (4.9)
Combining (4.8) and (4.9), then
∑ u ∈ V ∑ l = 1 k ∑ u i 1 l ∈ F 1 l x u i 1 l = ∑ l = 1 k ∑ e i ∈ E ( G ) ( x u i 1 l + x u i 3 l ) = ∑ u ∈ V − k + 4 3 ( k + 1 ) d u t . (4.10)
Combining (4.8) and (4.10), we have k 12 k + 1 m t = − 2 ( k + 4 ) 3 ( k + 1 ) m t . Since k is a integer, it is easy to obtain that t = 0 . Therefore, x u = 0 for all u ∈ V . By (3.5) to (3.7), one can see x u i 1 l = − x u i 3 l and x u i 2 l = 0 . The eigenvector x = ( x 1 , x 2 , ⋯ , x n + 3 k m ) t associated with σ = 4 3 can be completely determined by the following equation system:
{ x u i 1 l = − x u i 3 l , ∀ u i 1 l ∈ F 1 l , ∀ u i 3 l ∈ F 3 l x u i 2 l = 0 , ∀ u i 2 l ∈ F 2 l x u = 0 , ∀ u ∈ V ∑ l = 1 k ∑ u i 1 l ∈ F 1 u 1 3 ( k + 1 ) d u x u i 1 l = 0 , ∀ u ∈ V (4.11)
Let x u i 1 l = − x u i 3 l = y i l with i = 1 , 2 , ⋯ , m and l = 1 , 2 , ⋯ , k . Suppose
y = ( y 1 1 , y 2 1 , ⋯ , y m 1 , ⋯ , y 1 k , y 2 k , ⋯ , y m k ) k m t
Note that ∑ l = 1 k ∑ u i 1 l ∈ F 1 u 1 3 ( k + 1 ) d u x u i 1 l = 0 , ∀ u ∈ V . Let W → ( G ) = [ I → ( G ) , I → ( G ) , ⋯ , I → ( G ) ] n × k m , then we have
W → ( G ) y = 0. (4.12)
By Lemma 3.1, we know that r ( W → ( G ) ) = r ( I → ( G ) ) = n − 1 , system (4.12) has exactly k m − n + 1 linearly independent solutions. Thus p L ( F k ( G ) ) ( 4 3 ) = k m − n + 1 . Suppose p L ( F k ( G ) ) ( 5 − 13 6 ) = a and p L ( F k ( G ) ) ( 5 + 13 6 ) = b . In view of Lemma 3.3, we have
τ ( F k ( G ) ) = ∏ i = 1 n + 3 k m d i ' ⋅ ∏ i = 2 n − 1 [ 3 k + 8 18 ( k + 1 ) λ i ] ⋅ 3 k + 8 3 ( k + 1 ) ⋅ 5 k + 1 3 ( k + 1 ) ⋅ ( 4 3 ) k m − n + 1 ⋅ ( 5 − 13 6 ) a ⋅ ( 5 + 13 6 ) b 2 | E ( F k ( G ) ) | = 3 k m − n + 1 − a ⋅ 2 3 k m − 3 n + 3 ⋅ ( 3 k + 8 ) n − 1 ⋅ ( 5 + 13 6 ) b − a ⋅ τ ( G ) .
Since τ ( F k ( G ) ) and τ ( G ) are positive integers, it is obvious that a = b . Then we have p L ( F k ( G ) ) ( 5 − 13 6 ) = p L ( F k ( G ) ) ( 5 + 13 6 ) = k m − n + 1 by counting the number of the eigenvalues of F k ( G ) .
This completes the proofs of Theorem 2.1.
Proof. (i)-(iii) Let μ be an eigenvalue of L ( R k ( G ) ) with μ ≠ 1 , 3 ± 6 3 . By Lemma 3.7, we have
λ = 3 μ [ 3 ( k + 1 ) μ 3 − ( 12 k + 9 ) μ 2 + ( 15 k + 7 ) μ − ( 6 k + 1 ) ] 9 μ 3 − 27 μ 2 + 21 μ − ( k + 3 ) (4.13)
is an eigenvalue of L ( G ) with the same multiplicity as that of μ . Then we have
9 ( k + 1 ) μ 4 − ( 36 k + 9 λ + 27 ) μ 3 + ( 45 k + 27 λ + 21 ) μ 2 − ( 18 k + 21 + 3 ) μ + ( 3 + k ) λ = 0. (4.14)
Since 0 is an eigenvalue of L ( G ) with multiplicity 1, we substitute λ = 0 into (4.14) yields μ = 0 , 1 and 9 k ± 3 3 k 2 + 8 k + 8 + 6 6 ( k + 1 ) . By Lemma 3.3, λ n = 2 is an eigenvalue of L ( G ) with multiplicity 1 if G is bipartite. Substituting λ = 2 into (4.14) yields μ = 3 ± 6 3 , 6 k ± 3 4 k 2 + 4 k + 3 + 9 6 ( k + 1 ) .
This completes the proofs of (i)-(iii).
(iv) Substituting μ = 3 − 6 3 into (3.21) yields that
1 d u x u = − 1 d v x v . (4.15)
Since the connected simple graph G is non-bipartite, G contains an odd cycle, written as C 1 . In view of (4.15), we have x u d u = ( − 1 ) | V ( C 1 ) | x u d u = − x u d u . It is easy to conclude that x u = x v = 0 for u ∼ v . Note that G is connected, we have x u = 0 for all u ∈ V ( G ) . Combining with (3.16) to (3.20), we have x u i 1 l = x u i 2 l = x u i 3 l = x u i 4 l and ∑ l = 1 k ∑ u i 1 l ∈ R 1 l 1 3 ( k + 1 ) d u x u i 1 l = 0 .
Therefore, the eigenvector x = ( x 1 , x 2 , ⋯ , x n + 4 k m ) t associated with μ = 3 − 6 3 can be completely decided by the following equation system:
{ x u i 1 l = x u i 2 l = x u i 3 l = x u i 4 l , ∀ u i 1 l ∈ R 1 l , u i 2 l ∈ R 2 l , u i 3 l ∈ R 3 l , u i 4 l ∈ R 4 l x u = 0 , ∀ u ∈ O ∑ l = 1 k ∑ u i 1 l ∈ R 1 l 1 3 ( k + 1 ) d u x u i 1 l = 0 , ∀ u ∈ O (4.16)
Suppose x u i 1 l = x u i 2 l = x u i 3 l = x u i 4 l = z i l , with i = 1 , 2 , ⋯ , m and l = 1 , 2 , ⋯ , k . Let
z = ( z 1 1 , z 2 1 , ⋯ z m 1 , ⋯ , z 1 k , z 2 k , ⋯ z m k ) k m t .
Note that ∑ l = 1 k ∑ u i 1 l ∈ R 1 l 1 3 ( k + 1 ) d u x u i 1 l = 0 , ∀ u ∈ O . Let W ( G ) = [ I ( G ) , I ( G ) , ⋯ , I ( G ) ] n × k m . Then we have
W ( G ) z = 0. (4.17)
By Lemma 3.1, we know that r ( W ( G ) ) = r ( I ( G ) ) = n . System (4.17) has k m − n linearly independent solutions. Thus p L ( R k ( G ) ) ( 3 − 6 3 ) = k m − n . Similarly, substitute μ = 3 + 6 3 into (3.21), we can get p L ( R k ( G ) ) ( 3 + 6 3 ) = k m − n . Hence p L ( R k ( G ) ) ( 1 ) = 2 k m − n + 1 by counting the number of the eigenvalues of R k ( G ) .
This completes the proofs of (iv).
(v) Substituting μ = 1 into (3.20) yields that
1 d u x u = 1 d v x v . (4.18)
Suppose 1 d u x u = 1 d v x v = t . By (3.17) and (3.20), we have
x u i 2 l + x u i 3 l = − 2 k + 1 ⋅ t . (4.19)
In view of (3.18), we have that
x u i 1 l + x u i 4 l = 0. (4.20)
By (3.16), it is obvious that
∑ l = 1 k ∑ u i 1 l ∈ R 1 l x u i 1 l = − 3 k + 1 d u t . (4.21)
According to (4.20) and (4.21), we know that
∑ u ∈ O ∑ l = 1 k ∑ u i 1 l ∈ R 1 l x u i 1 l = ∑ l = 1 k ∑ e i ∈ E ( G ) ( x u i 1 l + x u i 4 l ) = ∑ u ∈ O − 3 k + 1 d u t . (4.22)
Combining (4.20) and (4.22), we have − 2 m 3 k + 1 t = 0 . Since k is a integer, it is easy to know that t = 0 , thus, x u = 0 for all u ∈ O . By (3.17) to (3.20), we have x u i 1 l = − x u i 4 l and x u i 2 l + x u i 3 l = 0 . The eigenvector x = ( x 1 , x 2 , ⋯ , x n + 4 k m ) t associated with μ = 1 can be completely determined by the following equation system
{ x u i 1 l = − x u i 4 l , ∀ u i 1 l ∈ R 1 l , u i 4 l ∈ R 4 l x u i 2 l = − x u i 3 l , ∀ u i 2 l ∈ R 2 l , u i 3 l ∈ R 3 l x u = 0 , ∀ u ∈ O ∑ l = 1 k ∑ u i 1 l ∈ R 1 l 1 3 ( k + 1 ) d u x u i 1 l = 0 , ∀ u ∈ O (4.23)
Suppose x u i 1 l = − x u i 4 l = z i 1 l and x u i 2 l = − x u i 3 l = z i 2 l , with i = 1 , 2 , ⋯ , m and l = 1 , 2 , ⋯ , k . Let
z = ( z 11 1 , z 12 1 , z 21 1 , z 22 1 , ⋯ , z m 1 1 , z m 2 1 , ⋯ , z 11 k , z 12 k , z 21 k , z 22 k , ⋯ , z m 1 k , z m 2 k ) 2 k m t . (4.24)
Note that ∑ l = 1 k ∑ u i 1 l ∈ R 1 l 1 3 ( k + 1 ) d u x u i 1 l = 0 , for all u ∈ O . Let W → ( G ) = [ I → ( G ) , I → ( G ) , ⋯ , I → ( G ) ] n × 2 k m . Then we have
W → ( G ) z = 0.
In view of Lemma 3.1, we know that r ( W → ( G ) ) = r ( I → ( G ) ) = n − 1 , system (4.24) has exactly 2 k m − n + 1 linearly independent solutions. Thus p L ( R k ( G ) ) ( 1 ) = 2 k m − n + 1 . Let p L ( R k ( G ) ) ( 3 − 6 3 ) = a and p L ( R k ( G ) ) ( 3 + 6 3 ) = b . By Lemma 3.3, we have
τ ( R k ( G ) ) = ∏ i = 1 n + 4 k m d i ' ⋅ ∏ i = 2 n − 1 [ 3 + k 9 ( k + 1 ) λ i ] ⋅ 2 k + 6 3 ( k + 1 ) ⋅ 6 k + 1 3 ( k + 1 ) ⋅ 1 2 k m − n + 1 ⋅ ( 3 − 6 3 ) a ⋅ ( 3 + 6 3 ) b 2 | E ( R k ( G ) ) | = 3 2 k m − 2 n + 2 − a ⋅ 2 2 k m − 1 ⋅ ( 2 k + 6 ) ⋅ ( k + 3 ) n − 2 ⋅ ( 3 + 6 3 ) b − a ⋅ τ ( G ) .
Note that τ ( R k ( G ) ) and τ ( G ) are positive integers, we have a = b . Therefore, p L ( R k ( G ) ) ( 3 − 6 3 ) = p L ( R k ( G ) ) ( 3 + 6 3 ) = k m − n + 1 by counting the number of the eigenvalues of R k ( G ) .
This completes the proofs of Theorem 2.2.
Note that F 0 k ( G ) = G , F 1 k ( G ) = F k ( G ) , F r k ( G ) = F k ( F r − 1 k ( G ) ) . Let ε r k and ς r k be the size and order of F r k ( G ) , respectively, where k ≥ 2 and r ≥ 1 . Then the following equations system can be obtained.
{ ε 0 k = m , ς 0 k = n , ε r k = ( 5 k + 1 ) ε r − 1 k , r ≥ 1 ς r k = ς r − 1 k + 3 k ε r − 1 k , r ≥ 1 .
Thus, we can get the general formula of ε r k and ς r k ,
ε r k = ( 5 k + 1 ) r m , ς r k = n + 3 [ ( 5 k + 1 ) r − 1 ] 5 m . (5.1)
The roots of 18 ( k + 1 ) σ 4 − ( 72 k + 18 λ + 54 ) σ 3 + ( 94 k + 54 λ + 46 ) σ 2 − ( 40 k + 46 λ + 2 k λ + 8 ) σ + ( 3 k + 8 ) λ = 0 are denoted by h i ( λ ) , with i = 1 , 2 , 3 , 4 . Let H be a multiset of real numbers, we have
h 1 ( H ) = ∪ x ∈ H { h 1 ( x ) } , h 2 ( H ) = ∪ x ∈ H { h 2 ( x ) } , h 3 ( H ) = ∪ x ∈ H { h 3 ( x ) } , h 4 ( H ) = ∪ x ∈ H { h 4 ( x ) } ,
where h 1 , h 2 , h 3 , h 4 are defined as above. Then the following theorem directly follows by Theorem 2.1 and the construction of F r k ( G ) .
Theorem 5.1. Let G be a simple connected graph of order n and size m. Then
S ( F r k ( G ) ) = { ∪ i = 1 4 h i [ S ( F k ( G ) ) \ { 0 , 2 } ] ∪ { 0 , 8 k ± 4 k 2 + 8 k + 13 + 5 6 ( k + 1 ) , 7 k ± 13 k 2 + 8 k + 4 + 10 6 ( k + 1 ) } ∪ { 5 ± 13 6 , ⋯ , 5 ± 13 6 ︸ k m − n + 1 } ∪ { 4 3 , ⋯ , 4 3 ︸ k m − n + 1 } , if r = 1 and G is bipartite ∪ i = 1 4 h i [ S ( F r k ( G ) ) \ { 0 } ] ∪ { 0 , 8 k ± 4 k 2 + 8 k + 13 + 5 6 ( k + 1 ) } ∪ { 5 ± 13 6 , ⋯ , 5 ± 13 6 ︸ k ε r − 1 k − ς r − 1 k + 1 } ∪ { 4 3 , ⋯ , 4 3 ︸ k ε r − 1 k − ς r − 1 k + 1 } , otherwise
Theorem 5.2. Let G be a simple connected graph of order n and size m. Then
(i)
K f * ( F r k ( G ) ) = [ 8 ( 5 k + 1 ) 2 ( 3 k + 8 ) ] r K f * ( G ) + ( 5 k + 1 ) r [ ( 12765 k + 27269 ) ( 15 k 2 + 43 k + 8 ) r − 1 − 26720 ( 40 k + 8 ) r − 1 − 549 ( 3 k + 8 ) r − 1 ] 1110 ( 3 k + 8 ) r − 1 m 2 − 61 ( 5 k + 1 ) r [ ( 40 k + 8 ) r − ( 3 k + 8 ) r ] 74 ( 3 k + 8 ) r m n + ( 101 k − 483 ) ( 5 k + 1 ) r − 1 [ ( 40 k + 8 ) r − ( 3 k + 8 ) r ] 74 ( 3 k + 8 ) r m .
(ii)
K e ( F r k ( G ) ) = [ 8 ( 5 k + 1 ) 2 ( 3 k + 8 ) ] r K e ( G ) + ( 12765 k + 27269 ) ( 15 k 2 + 43 k + 8 ) r − 1 − 26720 ( 40 k + 8 ) r − 1 − 549 ( 3 k + 8 ) r − 1 2220 ( 3 k + 8 ) r − 1 m − 61 [ ( 40 k + 8 ) r − ( 3 k + 8 ) r ] 148 ( 3 k + 8 ) r n + ( 101 k − 483 ) [ ( 40 k + 8 ) r − ( 3 k + 8 ) r ] 148 ( 5 k + 1 ) ( 3 k + 8 ) r .
(iii)
τ ( F r k ( G ) ) = ( 3 k + 8 ) ( n − 1 ) r − m { 3 r 5 − 3 [ ( 5 k + 1 ) r − 1 ] 25 k } ⋅ 2 3 m [ ( 5 k − 3 ) ( 5 k + 1 ) r + 15 k r − 5 k + 3 ] 25 k + 3 r − 3 n r ⋅ τ ( G ) .
Proof. (i) According to Theorem 2.1 (i), one can see that the four roots of 18 ( k + 1 ) σ 4 − ( 72 k + 18 λ + 54 ) σ 3 + ( 94 k + 54 λ + 46 ) σ 2 − ( 40 k + 46 λ + 2 k λ + 8 ) σ + ( 3 k + 8 ) λ = 0 , denoted by σ 1 ( λ i ) , σ 2 ( λ i ) , σ 3 ( λ i ) , σ 4 ( λ i ) , are the four corresponding eigenvalues of L ( F k ( G ) ) , when λ ≠ 0 .
By Vieta theorem, we obtain the following equation:
1 σ 1 ( λ i ) + 1 σ 2 ( λ i ) + 1 σ 3 ( λ i ) + 1 σ 4 ( λ i ) = 2 k + 46 3 k + 8 + 40 k + 8 ( 3 k + 8 ) λ i ,
σ 1 ( λ i ) σ 2 ( λ i ) σ 3 ( λ i ) σ 4 ( λ i ) = 3 k + 8 18 ( k + 1 ) λ i . (5.2)
Based on Theorem 2.1, Lemma 3.4, (5.1) and (5.2), we have
K f * ( F k ( G ) ) = 2 ε 1 k { ∑ i = 2 n [ 2 k + 46 3 k + 8 + 40 k + 8 ( 3 k + 8 ) λ i ] + 8 k + 5 5 k + 1 + 3 4 ( k m − n + 1 ) + ( 6 5 − 13 + 6 5 + 13 ) ( k m − n ) } = 16 ( 5 k + 1 ) 2 m 3 k + 8 ∑ i = 2 n 1 λ i + 23 k ( 5 k + 1 ) 2 m 2 − 61 k ( 5 k + 1 ) 2 ( 3 k + 8 ) m n + k ( 101 k − 483 ) 2 ( 3 k + 8 ) m = 8 ( 5 k + 1 ) 2 3 k + 8 K f * ( G ) + 23 k ( 5 k + 1 ) 2 m 2 − 61 k ( 5 k + 1 ) 2 ( 3 k + 8 ) m n + k ( 101 k − 483 ) 2 ( 3 k + 8 ) m .
Based on the above equation and the construction of F r k ( G ) ( k ≥ 2 , r ≥ 1 ), we have
K f * ( F r k ( G ) ) = 8 ( 5 k + 1 ) 2 3 k + 8 K f * ( F r − 1 k ( G ) ) + 23 k ( 5 k + 1 ) 2 ( ε r − 1 k ) 2 − 61 k ( 5 k + 1 ) 2 ( 3 k + 8 ) ε r − 1 k ς r − 1 k + k ( 101 k − 483 ) 2 ( 3 k + 8 ) ε r − 1 k = [ 8 ( 5 k + 1 ) 2 3 k + 8 ] r K f * ( G ) + 23 k ( 5 k + 1 ) 2 ∑ i = 0 r − 1 [ 8 ( 5 k + 1 ) 2 3 k + 8 ] r − 1 − i ( ε i k ) 2 − 61 k ( 5 k + 1 ) 2 ( 3 k + 8 ) ∑ i = 0 r − 1 [ 8 ( 5 k + 1 ) 2 3 k + 8 ] r − 1 − i ε i k ς i k + k ( 101 k − 483 ) 2 ( 3 k + 8 ) ∑ i = 0 r − 1 [ 8 ( 5 k + 1 ) 2 3 k + 8 ] r − 1 − i ε i k
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
K e ( F k ( G ) ) = 1 2 ε 1 k K f * ( F k ( G ) ) = 1 2 ( 5 k + 1 ) m [ 8 ( 5 k + 1 ) 2 3 k + 8 K f * ( G ) + 23 k ( 5 k + 1 ) 2 m 2 − 61 k ( 5 k + 1 ) 2 ( 3 k + 8 ) m n + k ( 101 k − 483 ) 2 ( 3 k + 8 ) m ] = 8 ( 5 k + 1 ) 3 k + 8 K e ( G ) + 23 4 k m − 61 k 4 ( 3 k + 8 ) n + k ( 101 k − 483 ) 4 ( 5 k + 1 ) ( 3 k + 8 ) .
Based on the above equation and the construction of F r k ( G ) ( k ≥ 2 , r ≥ 1 ), we have
K e ( F r k ( G ) ) = 8 ( 5 k + 1 ) 3 k + 8 K e ( G ) + 23 4 k m − 61 k 4 ( 3 k + 8 ) n + k ( 101 k − 483 ) 4 ( 5 k + 1 ) ( 3 k + 8 ) = [ 8 ( 5 k + 1 ) 3 k + 8 ] r K e ( G ) + 23 4 k ∑ i = 0 r − 1 [ 8 ( 5 k + 1 ) 3 k + 8 ] r − 1 − i ε i k − 61 k 4 ( 3 k + 8 ) ∑ i = 0 r − 1 [ 8 ( 5 k + 1 ) 3 k + 8 ] r − 1 − i ς i k + k ( 101 k − 483 ) 4 ( 5 k + 1 ) ( 3 k + 8 ) ∑ i = 0 r − 1 [ 8 ( 5 k + 1 ) 3 k + 8 ] i
By simple calculation, the conclusion can be easily drawn.
(iii) According to Theorem 2.1, Lemma 3.2, and (5.1), one can see
τ ( F k ( G ) ) = ∏ i = 1 ς 1 k d i ' ⋅ ∏ i = 2 n [ 3 k + 8 18 ( k + 1 ) λ i ] ⋅ ( 5 − 13 6 ) k m − n ⋅ ( 5 + 13 6 ) k m − n ⋅ ( 4 3 ) k m − n + 1 ⋅ 5 k + 1 3 ( k + 1 ) 2 ε 1 k = ( 3 k + 8 ) n − 1 ⋅ 2 3 k m − 3 n + 3 ⋅ ∏ i = 1 n d i ⋅ ∏ i = 2 n λ i 2 m = ( 3 k + 8 ) n − 1 ⋅ 2 3 k m − 3 n + 3 ⋅ τ ( G ) .
From the above equation and the construction of F r k ( G ) ( k ≥ 2 , r ≥ 1 ), we have
τ ( F r k ( G ) ) = ( 3 k + 8 ) ς r − 1 k − 1 ⋅ 2 3 k ε r − 1 k − 3 ς r − 1 k + 3 ⋅ τ ( F r − 1 k ( G ) ) = ( 3 k + 8 ) ∑ i = 0 r − 1 ς i k − r ⋅ 2 ∑ i = 0 r − 1 ( 3 k ε i k − 3 ς i k ) + 3 r ⋅ τ ( G ) = ( 3 k + 8 ) ( n − 1 ) r − m { 3 r 5 − 3 [ ( 5 k + 1 ) r − 1 ] 25 k } ⋅ 2 3 m [ ( 5 k − 3 ) ( 5 k + 1 ) r + 15 k r − 5 k + 3 ] 25 k + 3 r − 3 n r ⋅ τ ( G )
This completes the proofs of Theorem 5.2.
Note that R 0 k ( G ) = G , R 1 k ( G ) = R k ( G ) , R r k ( G ) = R k ( R r − 1 k ( G ) ) . Let ε r k and ς r k be the size and order of R r k ( G ) , respectively, where k ≥ 2 and r ≥ 1 . The following equations can be obtained.
{ ε 0 k = m , ς 0 k = n , ε r k = ( 6 k + 1 ) ε r − 1 k , r ≥ 1 ς r k = ς r − 1 k + 4 k ε r − 1 k , r ≥ 1
It follows that
ε r k = ( 6 k + 1 ) r m , ς r k = n + 2 [ ( 6 k + 1 ) r − 1 ] 3 m . (5.3)
The four roots of 9 ( k + 1 ) μ 4 − ( 36 k + 9 λ + 27 ) μ 3 + ( 45 k + 27 λ + 21 ) μ 2 − ( 18 k + 21 + 3 ) μ + ( 3 + k ) λ = 0 are denoted by f 1 ( λ ) , f 2 ( λ ) , f 3 ( λ ) and f 4 ( λ ) , respectively. For a multiset H of for real numbers, we may define four new multiset:
f 1 ( H ) = ∪ x ∈ H { f 1 ( x ) } , f 2 ( H ) = ∪ x ∈ H { f 2 ( x ) } , f 3 ( H ) = ∪ x ∈ H { f 3 ( x ) } , f 4 ( H ) = ∪ x ∈ H { f 4 ( x ) } ,
Similarly, the following results on the spectrum of R r k ( G ) ( k ≥ 2 , r ≥ 1 ) follows immediately by Theorem 2.2 and the construction of R r k ( G ) from G.
Theorem 5.3. Let G be a simple connected graph of order n and size m. Then
S ( R r k ( G ) ) = { ∪ i = 1 4 f i [ S ( R k ( G ) ) \ { 0 , 2 } ] ∪ { 0 , 9 k ± 3 3 k 2 + 8 k + 8 + 6 6 ( k + 1 ) , 6 k ± 3 4 k 2 + 4 k + 3 + 9 6 ( k + 1 ) } ∪ { 1 , ⋯ , 1 ︸ 2 k m − n + 1 } ∪ { 3 ± 6 3 , ⋯ , 3 ± 6 3 ︸ k m − n + 1 } , if r = 1 and G is bipartite ∪ i = 1 4 f i [ S ( R r k ( G ) ) \ { 0 } ] ∪ { 0 , 9 k ± 3 3 k 2 + 8 k + 8 + 6 6 ( k + 1 ) } ∪ { 1 , ⋯ , 1 ︸ 2 k ε r − 1 k − ς r − 1 k + 1 } ∪ { 3 ± 6 3 , ⋯ , 3 ± 6 3 ︸ k ε r − 1 k − ς r − 1 k + 1 } , otherwise
Theorem 5.4. Let G be a simple connected graph of order n and size m. Then
(i)
K f * ( R r k ( G ) ) = [ 3 ( 6 k + 1 ) 2 ( k + 3 ) ] r K f * ( G ) − ( 6 k + 1 ) r [ 1944 ( 18 k + 3 ) r − 1 + 28 ( k + 3 ) r − 1 − ( 1972 + 816 k ) ( 6 k + 1 ) r − 1 ( k + 3 ) r − 1 ] 51 ( k + 3 ) r − 1 m 2 − 14 ( 6 k + 1 ) r [ ( 18 k + 3 ) r − ( k + 3 ) r ] 17 ( k + 3 ) r m n + 2 ( 6 k + 1 ) r − 1 ( 15 k − 74 ) [ ( 18 k + 3 ) r − ( k + 3 ) r ] 17 ( k + 3 ) r m .
(ii)
K e ( R r k ( G ) ) = [ 3 ( 6 k + 1 ) 2 ( k + 3 ) ] r K e ( G ) − 972 ( 18 k + 3 ) r − 1 + 14 ( k + 3 ) r − 1 − ( 986 + 408 k ) ( 6 k + 1 ) r − 1 ( k + 3 ) r − 1 51 ( k + 3 ) r − 1 m − 7 [ ( 18 k + 3 ) r − ( k + 3 ) r ] 17 ( k + 3 ) r n + ( 15 k − 74 ) [ ( 18 k + 3 ) r − ( k + 3 ) r ] 17 ( 6 k + 1 ) ( k + 3 ) r .
(iii)
τ ( R r k ( G ) ) = ( k + 3 ) ( n − 1 ) r − m { 6 k r − ( 6 k + 1 ) r + 1 9 k } ⋅ 3 ( r − n r ) + m [ 12 k r − 3 r + ( 3 k − 2 ) ( 6 k + 1 ) r + 2 ] 18 k ⋅ 2 m [ ( 6 k + 1 ) r − 1 ] 3 ⋅ τ ( G ) .
Proof. (i) By Theorem 2.2, the four corresponding eigenvalues μ 1 ( λ i ) , μ 2 ( λ i ) , μ 3 ( λ i ) , μ 4 ( λ i ) of L ( R k ( G ) ) are roots of 9 ( k + 1 ) μ 4 − ( 36 k + 9 λ + 27 ) μ 3 + ( 45 k + 27 λ + 21 ) μ 2 − ( 18 k + 21 + 3 ) μ + ( 3 + k ) λ = 0
Thus μ 1 ( λ i ) , μ 2 ( λ i ) , μ 3 ( λ i ) , μ 4 ( λ i ) satisfy the following equation:
1 μ 1 ( λ i ) + 1 μ 2 ( λ i ) + 1 μ 3 ( λ i ) + 1 μ 4 ( λ i ) = 21 k + 3 + 18 k + 3 ( k + 3 ) λ i ,
μ 1 ( λ i ) μ 2 ( λ i ) μ 3 ( λ i ) μ 4 ( λ i ) = k + 3 9 ( k + 1 ) λ i . (5.4)
In view of Theorem 2.2, Lemma 3.3, (5.3) and (5.4), one can see
K f * ( R k ( G ) ) = 2 ε 1 k { ∑ i = 2 n [ 21 k + 3 + 18 k + 3 ( k + 3 ) λ i ] + 9 k + 6 6 k + 1 + ( 2 k m − n + 1 ) + ( 3 3 − 6 + 3 3 + 6 ) ( k m − n ) } = 6 ( 6 k + 1 ) 2 m k + 3 ∑ i = 2 n 1 λ i + 16 k ( 6 k + 1 ) m 2 − 14 k ( 6 k + 1 ) k + 3 m n + 2 k ( 15 k − 74 ) k + 3 m = 3 ( 6 k + 1 ) 2 k + 3 K f * ( G ) + 16 k ( 6 k + 1 ) m 2 − 14 k ( 6 k + 1 ) k + 3 m n + 2 k ( 15 k − 74 ) k + 3 m .
Based on the above equation and the construction of R k ( G ) ( k ≥ 2 , r ≥ 1 ), we have
K f * ( R r k ( G ) ) = 3 ( 6 k + 1 ) 2 k + 3 K f * ( R r − 1 k ( G ) ) + 16 k ( 6 k + 1 ) ( ε r − 1 k ) 2 − 14 k ( 6 k + 1 ) k + 3 ε r − 1 k ς r − 1 k + 2 k ( 15 k − 74 ) k + 3 ε r − 1 k = [ 3 ( 6 k + 1 ) 2 k + 3 ] r K f * ( G ) + 16 k ( 6 k + 1 ) ∑ i = 0 r − 1 [ 3 ( 6 k + 1 ) 2 k + 3 ] r − 1 − i ( ε i k ) 2 − 14 k ( 6 k + 1 ) k + 3 ∑ i = 0 r − 1 [ 3 ( 6 k + 1 ) 2 k + 3 ] r − 1 − i ε i k ς i k + 2 k ( 15 k − 74 ) k + 3 ∑ i = 0 r − 1 [ 3 ( 6 k + 1 ) 2 k + 3 ] r − 1 − i ε i k .
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
K e ( R k ( G ) ) = 1 2 ε 1 k K f * ( R k ( G ) ) = 1 2 ( 6 k + 1 ) m [ 3 ( 6 k + 1 ) 2 k + 3 K f * ( G ) + 16 k ( 6 k + 1 ) m 2 − 14 k ( 6 k + 1 ) k + 3 m n + 2 k ( 15 k − 74 ) k + 3 m ] = 3 ( 6 k + 1 ) k + 3 K e ( G ) + 8 k m − 7 k k + 3 n + k ( 15 k − 74 ) ( 6 k + 1 ) ( k + 3 ) .
Based on the above equation and the construction of R k ( G ) ( k ≥ 2 , r ≥ 1 ) that
K e ( R r k ( G ) ) = 3 ( 6 k + 1 ) k + 3 K e ( G ) + 8 k m − 7 k k + 3 n + k ( 15 k − 74 ) ( 6 k + 1 ) ( k + 3 ) = [ 3 ( 6 k + 1 ) k + 3 ] r K e ( G ) + 8 k ∑ i = 0 r − 1 [ 3 ( 6 k + 1 ) k + 3 ] r − 1 − i ε i k − 7 k k + 3 ∑ i = 0 r − 1 [ 3 ( 6 k + 1 ) k + 3 ] r − 1 − i ς i k + k ( 15 k − 74 ) ( 6 k + 1 ) ( k + 3 ) ∑ i = 0 r − 1 [ 3 ( 6 k + 1 ) k + 3 ] i .
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
τ ( F k ( G ) ) = ∏ i = 1 ς 1 k d i ' ⋅ ∏ i = 2 n [ k + 3 9 ( k + 1 ) λ i ] ⋅ ( 3 − 6 3 ) k m − n ⋅ ( 3 + 6 3 ) k m − n ⋅ 1 k m − n + 1 ⋅ 6 k + 1 3 ( k + 1 ) 2 ε 1 k = ( k + 3 ) n − 1 ⋅ 2 2 k m ⋅ 3 k m − n + 1 ⋅ ∏ i = 1 n d i ⋅ ∏ i = 2 n λ i 2 m = ( k + 3 ) n − 1 ⋅ 2 2 k m ⋅ 3 k m − n + 1 ⋅ τ ( G ) .
Based on the above equation and the construction of R k ( G ) ( k ≥ 2 , r ≥ 1 ), we have
τ ( R r k ( G ) ) = ( k + 3 ) ς r − 1 k − 1 ⋅ 2 3 k ε r − 1 k ⋅ 3 k ε r − 1 k − ς r − 1 k + 1 ⋅ τ ( R r − 1 k ( G ) ) = ( k + 3 ) ∑ i = 0 r − 1 ς i k − r ⋅ 2 2 k ∑ i = 0 r − 1 ( ε i k ) ⋅ 3 ∑ i = 0 r − 1 ( k ε i k − ς i k ) + r ⋅ τ ( G ) = ( k + 3 ) ( n − 1 ) r − m { 6 k r − ( 6 k + 1 ) r + 1 9 k } ⋅ 3 ( r − n r ) + m [ 12 k r − 3 r + ( 3 k − 2 ) ( 6 k + 1 ) r + 2 ] 18 k ⋅ 2 m [ ( 6 k + 1 ) r − 1 ] 3 ⋅ τ ( G ) .
This completes the proofs of Theorem 5.4.
The authors declare no conflicts of interest regarding the publication of this paper.
Liu, C., Pan, Y.G., Li, J.P. and Dai, L. (2020) The Normalized Laplacians on Both Two Iterated Constructions Associated with Graph and Their Applications. Journal of Applied Mathematics and Physics, 8, 838-860. https://doi.org/10.4236/jamp.2020.85066