^{1}

^{*}

^{1}

^{1}

We called graph G non-singular if adjacency matrix A ( G) of G is non-singular. A connected graph with n vertices and n-1, n and n+1 edges are called the tree, the unicyclic graph and the bicyclic graph. Respectively, as we all know, each connected bicyclic graph must contain ∞( a, s, b) or θ( p, l, q) as the induced subgraph. In this paper, by using three graph transformations which do not change the singularity of the graph, the non-singular trees, unicyclic graphs and bicyclic graphs are obtained.

This paper considers only finite undirected simple graphs. Let G be a graph with order n, the matrix A is defined as the adjacency matrix of graph G, which is defined as follows: A ( G ) = ( a i j ) n × n

a i j = ( 1 if i ∼ j , 0 others .

Obviously, A ( G ) is a real symmetric matrix with diagonal elements of 0 and other elements of 0 or 1, its eigenvalues are real number. The eigenvalues of A ( G ) are also said to be the eigenvalues of the graph G, collection n eigenvalues of G to form the spectrum of this graph. The number of nonzero eigenvalues and zero eigenvalues in the spectrum of the graph G are called the rant and nullity of the graph G, and denoted by r ( G ) and η ( G ) , respectively, obviously r ( G ) + η ( G ) = n .

The chemist discovered, η ( G ) = 0 is a necessary condition for the chemical stability of the molecules shown in the graph G [

A connected graph of order n, the graph respectively with size n − 1 , n and n + 1 are called the tree, the unicyclic graph and the bicyclic graph. As usual, P n , C n and K n denoted respectively the path, the cycle and the complete graph on n vertices. K 0 denoted the null graph (namely, a graph without vertex). The graph obtained by bonding the two ends of the P s ( s ≥ 1 ) to one vertex on C a and C b is recorded as ∞ ( a , s , b ) , when s = 1 , ∞ ( a ,1, b ) denotes the graph obtained by bonding a vertex on C a with a vertex on C b . The graphs obtained by bonding the starting vertices and the end vertices of the P l , P p and P q are respectively is recorded as θ ( p , l , q ) , where min { p , l , q } ≥ 2 and one of them at most is 2 (as shown in

Let A , B be two n-order real symmetric matrices, if there is an invertible matrix P of order n such that P T A P = B , then we say that A is congruent to B, denoted by A ≃ B .

Lemma 2.1. [

Lemma 2.2. Let G = G 1 ∪ G 2 ∪ ⋯ ∪ G t , where G i ( i = 1 , 2 , ⋯ , t ) are connected components of G. Then η ( G ) = ∑ i = 1 t η ( G i ) . Equivalent G is non-singular if and only if every G i ( i = 1 , 2 , ⋯ , t ) is non-singular.

Lemma 2.3. [

Lemma 2.4. [

Lemma 2.5. [

We called the three graph transformations are given which does not change the singularity of the graph in Lemma 2.3, Lemma 2.4 and Lemma 2.5 are the graph transformation I, the graph transformation I and the graph transformation III, respectively.

We called the subgraph is elementary subgraph of G in which every component is K 2 or cycle. If a elementary subgraph of G contains all the vertices of G, then called this elementary subgraph that is the elementary spanning subgraph of G.

Lemma 2.6. [

d e t ( A ( G ) ) = ( − 1 ) n ∑ H ∈ H ( − 1 ) p ( H ) 2 c ( H ) ,

where H is the set of elementary spanning subgraph of G, p ( H ) denotes the number of components of H and c ( H ) denotes the number of cycles in H.

We agree K 0 is non-singular and denoted by Ω 1 = { K 0 } .

Theorem 3.1. If T is a tree with order n, then T is non-singular if and only if T is changed to K 0 by a series of the graph transformation I.

Proof. As we all know, T is changed to H = r K 1 by a series of the graph transformation I, T is non-singular if and only if H is non-singular. When r > 0 , then H is singular, when r = 0 , then H = K 0 is non-singular. So T is non-singular if and only if T is changed to K 0 by a series of the graph transformation I.

Corollary 3.1. If a tree is non-singular if and only if T has a perfect matching.

Lemma 3.1. If a cycle C n is non-singular if and only if 4 ∤ n .

Proof. According Lemma 2.6, we can easily calculate d e t ( A ( C 3 ) ) = 2 , d e t ( A ( C 4 ) ) = 0 , d e t ( A ( C 5 ) ) = 2 , d e t ( A ( C 6 ) ) = − 4 . Let n = 4 q + r , q ≥ 0 , 3 ≤ r ≤ 6 , C n is changed to C r by a series of the graph transformation II. Therefore C n is non-singular if and only if C r is non-singular and if and only if 4 ∤ n .

Denoted by Ω 2 = { C 3 , C 5 , C 6 } .

Theorem 3.2. Let G is a unicyclic graph, then G is non-singular if and only if it is changed to H ∈ Ω 1 ∪ Ω 2 by a series of the graph transformation I and the graph transformation II.

Proof. As everyone knows, the unicyclic graph can always change to r K 1 , C n or r K 1 ∪ C n through a series of the graph transformation I, and change to H = r K 1 , C s or r K 1 ∪ C s ( 3 ≤ s ≤ 6 ) through a series of the graph transformation II. By the Theorem 3.1 and the Lemma 3.1, unicyclic graph G is non-singular if and only if H is non-singular, and if and only if H ∈ Ω 1 ∪ Ω 2 .

Denoted by

Γ 1 = { ∞ ( 3 , 1 , 3 ) , ∞ ( 3 , 2 , 3 ) , ∞ ( 3 , 3 , 3 ) , ∞ ( 3 , 4 , 3 ) , ∞ ( 3 , 5 , 3 ) , ∞ ( 3 , 2 , 5 ) , ∞ ( 3 , 4 , 5 ) , ∞ ( 3 , 1 , 6 ) , ∞ ( 3 , 2 , 6 ) , ∞ ( 3 , 3 , 6 ) , ∞ ( 3 , 4 , 6 ) , ∞ ( 3 , 5 , 6 ) , ∞ ( 5 , 1 , 5 ) , ∞ ( 5 , 2 , 5 ) , ∞ ( 5 , 3 , 5 ) , ∞ ( 5 , 4 , 5 ) , ∞ ( 5 , 5 , 5 ) , ∞ ( 5 , 1 , 6 ) , ∞ ( 5 , 2 , 6 ) , ∞ ( 5 , 3 , 6 ) , ∞ ( 5 , 4 , 6 ) , ∞ ( 5 , 5 , 6 ) , ∞ ( 6 , 2 , 6 ) , ∞ ( 6 , 4 , 6 ) } .

Lemma 3.2. If G = ∞ ( a , s , b ) , then G is non-singular if and only if G is changed to H ∈ Γ 1 by a series of the graph transformation II.

Proof. At first, we can prove graphs in the Γ 1 are non-singular. Taking ∞ ( 3,2,6 ) as an example, it has a elementary spanning subgraph C 6 ∪ C 3 ; two C 3 ∪ 3 K 2 , so by Lemma 2.6, we can easily calculate d e t ( A ( ∞ ( 3,2,6 ) ) ) = ( − 1 ) 9 [ ( − 1 ) 2 2 2 + ( − 1 ) 4 2 × 2 ] = − 8 . The others are similar, so we have following:

d e t ( A ( ∞ ( 3,1,3 ) ) ) = − 4 , d e t ( A ( ∞ ( 3,2,3 ) ) ) = 3 , d e t ( A ( ∞ ( 3,3,3 ) ) ) = 4 , d e t ( A ( ∞ ( 3,4,3 ) ) ) = − 3 , d e t ( A ( ∞ ( 3,5,3 ) ) ) = − 4 , d e t ( A ( ∞ ( 3,2,5 ) ) ) = 5 , d e t ( A ( ∞ ( 3,4,5 ) ) ) = − 5 , d e t ( A ( ∞ ( 3,1,6 ) ) ) = 4 , d e t ( A ( ∞ ( 3,2,6 ) ) ) = − 8 , d e t ( A ( ∞ ( 3,3,6 ) ) ) = − 4 , d e t ( A ( ∞ ( 3,4,6 ) ) ) = 8 , d e t ( A ( ∞ ( 3,5,6 ) ) ) = 4 ,

d e t ( A ( ∞ ( 5 , 1 , 5 ) ) ) = 4 , d e t ( A ( ∞ ( 5 , 2 , 5 ) ) ) = 3 , d e t ( A ( ∞ ( 5 , 3 , 5 ) ) ) = − 2 , d e t ( A ( ∞ ( 5 , 4 , 5 ) ) ) = − 3 , d e t ( A ( ∞ ( 5 , 5 , 5 ) ) ) = 4 , d e t ( A ( ∞ ( 5 , 1 , 6 ) ) ) = − 4 , d e t ( A ( ∞ ( 5 , 2 , 6 ) ) ) = − 8 , d e t ( A ( ∞ ( 5 , 3 , 6 ) ) ) = 4 , d e t ( A ( ∞ ( 5 , 4 , 6 ) ) ) = 8 , d e t ( A ( ∞ ( 5 , 5 , 6 ) ) ) = − 4 , d e t ( A ( ∞ ( 6 , 2 , 6 ) ) ) = 16 , d e t ( A ( ∞ ( 6 , 4 , 6 ) ) ) = − 16.

Denoted by

Δ 1 = { ∞ ( 3 , 1 , 4 ) , ∞ ( 3 , 2 , 4 ) , ∞ ( 3 , 3 , 4 ) , ∞ ( 3 , 4 , 4 ) , ∞ ( 3 , 5 , 4 ) , ∞ ( 3 , 1 , 5 ) , ∞ ( 3 , 3 , 5 ) , ∞ ( 4 , 1 , 4 ) , ∞ ( 4 , 2 , 4 ) , ∞ ( 4 , 3 , 4 ) , ∞ ( 4 , 4 , 4 ) , ∞ ( 4 , 5 , 4 ) , ∞ ( 4 , 1 , 5 ) , ∞ ( 4 , 2 , 5 ) , ∞ ( 4 , 3 , 5 ) , ∞ ( 4 , 4 , 5 ) , ∞ ( 4 , 5 , 5 ) , ∞ ( 4 , 1 , 6 ) , ∞ ( 4 , 2 , 6 ) , ∞ ( 4 , 3 , 6 ) , ∞ ( 4 , 4 , 6 ) , ∞ ( 4 , 5 , 6 ) , ∞ ( 6 , 1 , 6 ) , ∞ ( 6 , 3 , 6 ) , ∞ ( 6 , 5 , 6 ) } .

Then we prove graphs in the Δ 1 are singular. For graph ∞ ( 4, s , b ) or ∞ ( a , s ,4 ) , we use the graph transformation III, will get a graph which contains K 1 , yet K 1 provides a zero eigenvalue, so these kind of graphs are singular.

For the others, we have following:

d e t ( A ( ∞ ( 3,1,5 ) ) ) = 0 , d e t ( A ( ∞ ( 3,3 , 5 ) ) ) = 0 , d e t ( A ( ∞ ( 6,1,6 ) ) ) = 0 , d e t ( A ( ∞ ( 6,3,6 ) ) ) = 0 , d e t ( A ( ∞ ( 6,5,6 ) ) ) = 0.

At last, let a ≥ 3, b ≥ 3, s ≥ 1 , and a = 4 i + a ′ ( 3 ≤ a ′ ≤ 6 ) , b = 4 j + b ′ ( 3 ≤ b ′ ≤ 6 ) , s = 4 k + a ′ ( 1 ≤ s ′ ≤ 5 ) , for graph ∞ ( a , s , b ) , we repeatedly use the graph transformation II, will get graph ∞ ( a ′ , s ′ , b ′ ) ∈ Γ 1 ∪ Δ 1 . So ∞ ( a , s , b ) is non-singular if and only if ∞ ( a ′ , s ′ , b ′ ) is non-singular, if and only if ∞ ( a ′ , s ′ , b ′ ) ∈ Γ 1 .

Denoted by

Γ 2 = { θ ( 2,3,5 ) , θ ( 2,3,6 ) , θ ( 2,4,4 ) , θ ( 2,4,6 ) , θ ( 2,5,6 ) , θ ( 2,6,6 ) , θ ( 3,4,4 ) , θ ( 3,4,5 ) , θ ( 4,4,4 ) , θ ( 4,4,5 ) }

Lemma 3.3. Let G = θ ( p , l , q ) , then G is non-singular if and only if G is changed to H ∈ Γ 2 through a series of the graph transformation II.

Proof. First of all, we can prove that the graphs in the Γ 2 are non-singular. Taking θ ( 2,3,5 ) as an example, it has a elementary spanning subgraph C 6 ; two 3 K 2 , so by Lemma 2.6, we can calculate d e t ( A ( θ ( 2,3,5 ) ) ) = ( − 1 ) 6 [ ( − 1 ) 1 2 + ( − 1 ) 3 × 2 ] = − 4 . The others are similar, so we have following:

d e t ( A ( ∞ ( 2 , 3 , 6 ) ) ) = 4 , d e t ( A ( ∞ ( 2 , 4 , 4 ) ) ) = − 1 , d e t ( A ( ∞ ( 2 , 4 , 6 ) ) ) = 1 , d e t ( A ( ∞ ( 2 , 5 , 6 ) ) ) = 4 , d e t ( A ( ∞ ( 2 , 6 , 6 ) ) ) = − 9 , d e t ( A ( ∞ ( 3,4,4 ) ) ) = − 4 , d e t ( A ( ∞ ( 3 , 4 , 5 ) ) ) = 4 , d e t ( A ( ∞ ( 4 , 4 , 4 ) ) ) = 9 , d e t ( A ( ∞ ( 4 , 4 , 5 ) ) ) = − 4.

Denoted by

Δ 2 = { θ ( 2 , 3 , 3 ) , θ ( 2 , 3 , 4 ) , θ ( 2 , 4 , 5 ) , θ ( 2 , 5 , 5 ) , θ ( 3 , 3 , 3 ) , θ ( 3 , 3 , 4 ) , θ ( 3 , 3 , 5 ) , θ ( 3 , 5 , 5 ) , θ ( 4 , 5 , 5 ) , θ ( 5 , 5 , 5 ) } .

We can easily prove that graphs in the Δ 2 are singular.

At last, let p ≥ 2, l ≥ 3, q ≥ 3 , and p = 4 i + p ′ ( 2 ≤ p ′ ≤ 5 ) , l = 4 j + l ′ ( 2 ≤ l ′ ≤ 5 ) , q = 4 k + q ′ ( 2 ≤ q ′ ≤ 5 ) , for graph θ ( p , l , q ) , we repeatedly use the graph transformation II, will get graph θ ( p ′ , l ′ , q ′ ) ∈ Γ 2 ∪ Δ 2 . So, θ ( p , l , q ) is non-singular if and only if θ ( p ′ , l ′ , q ′ ) is non-singular, if and only if θ ( p ′ , l ′ , q ′ ) ∈ Γ 2 .

Denoted by Ω 3 = Γ 1 ∪ Γ 2 .

Theorem 3.3. Let G be a bicyclic graph, then G is non-singular if and only if G is changed to H ∈ Ω 1 ∪ Ω 2 ∪ Ω 3 by a series of the graph transformation I and the graph transformation II.

Proof. As everyone knows, the bicyclic graph can always change to r K 1 , C n , ∞ ( a , s , b ) , θ ( p , l , q ) , r K 1 ∪ C n , r K 1 ∪ ∞ ( a , s , b ) or r K 1 ∪ θ ( p , l , q ) through a series of the graph transformation I, and change to H = r K 1 ∪ H ′ , H ′ ∈ { K 0 , C r ( 3 ≤ r ≤ 6 ) } ∪ Γ 1 ∪ Δ 1 ∪ Γ 2 ∪ Δ 2 through a series of the graph transformation II. By the Lemma 2.3 and the Lemma 2.4, bicyclic graph G is non-singular if and only if H is non-singular, and by the Theorem 3.1, Theorem 3.2, Lemma 3.2 and the Lemma 3.3, H is non-singular if and only if H = H ′ ∈ Ω 1 ∪ Ω 2 ∪ Ω 3 .

By using three graph transformations which do not change the singularity of the graph, we found the non-singular trees, unicyclic graphs and bicyclic graphs. After writing this paper, I am very inspired; therefore, I want to do further research on the rank of graphs of more complex structures and so on.

This work is supported by National Natural Science Foundation of China (11561056, 11661066), National Natural Science Foundation of Qinghai Province (2016-ZJ-914).

The authors declare no conflicts of interest regarding the publication of this paper.

Ma, H.C., Li, D.Y. and Xie, C.L. (2020) Non-Singular Trees, Uni- cyclic Graphs and Bicyclic Graphs. Applied Mathematics, 11, 1-7. https://doi.org/10.4236/am.2020.111001