^{1}

^{*}

^{1}

^{1}

Let
*G* be a graph of order n with vertex set
V(
G) = {
v
_{1},
v
_{2},…,
v
_{n}}. the adjacency matrix of
*G* is an
n ×
n matrix
A(
G) = (
*a*
_{ij})
_{n×n}, where
*a*
_{ij} is the number edges joining
v
_{i} and
v
_{j} in
*G*. The eigenvalues
*λ*
_{1},
*λ*
_{2},
*λ*
_{3},…,
* λ _{n}*, of
A(
G) are said to be the eigenvalues of the graph

*G*and to form the spectrum of this graph. The number of nonzero eigenvalues and zero eigenvalues in the spectrum of

*G*are called rank and nullity of the graph

*G*, and are denoted by

*r*(

*G*) and

*η*(

*G*), respectively. It follows from the definitions that

*r*(

*G*) +

*η*(

*G*) = n. In this paper, by using the operation of multiplication of vertices, a characterization for graph

*G*with pendant vertices and

*r*(

*G*) = 7 is shown, and then a characterization for graph

*G*with pendant vertices and

*r*(

*G*) less than or equal to 7 is shown.

This paper considers only finite undirected simple graphs. Let G be a graph with order n, its the adjacency matrix 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 in which all diagonal elements are 0 and all other elements are 0 or 1, its eigenvalues are all real numbers. The n eigenvalues of A ( G ) are said to be the eigenvalues of the graph G and to form the spectrum of this graph. The number of nonzero and the number of zero eigenvalues in the spectrum of G are called rank and nullity of the graph G, and are denoted by r ( G ) and η ( G ) respectively. Obviously r ( G ) + η ( G ) = n . There have been diverse studies on the nullity of a graph [

This paper is organized as follows: In Section 2, some necessary lemmas are given, in Section 3, a characterization for graph G with pendant vertices and r ( G ) = 7 is shown, and then a characterization for graph G with pendant vertices and r ( G ) ≤ 7 is shown.

Let G be a graph, for a vertex x ∈ V ( G ) , define N G ( x ) to be the neighborhood of vertex x in G. A vertex subset I ⊆ V ( G ) of a graph G is an independent set of G if G [ I ] , the subgraph induced by I, is edgeless. Now let us introduce a graph operation. Let V ( G ) = { v 1 , v 2 , ⋯ , v n } , and m = ( m 1 , m 2 , ⋯ , m n ) be a vector of positive integers. Denote by G ∘ m the graph obtained from G by replacing each vertex v i of G with an independent set of m i vertices { v i 1 , v i 2 , ⋯ , v i m i } and joining v i s with v j t if and only if v i and v j are adjacent in G. The resulting graph G ∘ m is said to be obtained from G by multiplication of vertices. Let Λ be the set of some graphs, we denote by M ( Λ ) class of all graphs that can be constructed from one of the graphs in Λ by multiplication of vertices. K n denotes the complete graph on n vertices. Undefined concepts and notations will follow [

Lemma 2.1. [

1) Let H 1 and H 2 be two graphs, if G = H 1 ∪ H 2 , then r ( G ) = r ( H 1 ) + r ( H 2 ) .

2) Let H be a vertex-induced subgraph of G, then r ( H ) ≤ r ( G ) .

Lemma 2.2. [

Lemma 2.2 indicates that multiplication of vertices does not change the rank of the graph. A graph is called a basic graph if it has no isolated vertices and can not be obtained from other graphs by multiplication of vertices. Otherwise, it is not a basic graph. Hence, a graph with no isolated vertices is not a basic graph if and only if it has two vertices which have the same neighborhoods. According to the lemma 2.2, to characterize a graph of rank k, we only need to characterize all the basic graphs of rank k. In [

Lemma 2.3. [

Lemma 2.4. [

Lemma 2.5. [

Let H be a graph with V ( H ) = { v 1 , v 2 , ⋯ , v n } , and m = ( m 1 , m 2 , ⋯ , m n ) is a vector with m i = 1 or 2, ( i = 1 , 2 , ⋯ , n ). Then V ( H ) can be divided into two sets: V 1 = { v i ∈ V ( H ) | m i = 1 } and V 2 = { v i ∈ V ( H ) | m i = 2 } . Let v i 1 and v i 2 be the vertices in H ∘ m by multiplying the vertex v i in H when m i = 2 . For a subset U ⊆ V 1 , we construct a graph ( H ∘ m ) U as follows:

V ( ( H ∘ m ) U ) = { x , y } ∪ V ( H ∘ m )

E ( ( H ∘ m ) U ) = { x y } ∪ { y v i 1 | ∀ i , m i = 2 } ∪ { y v i | v i ∈ U } ∪ E ( H ∘ m ) .

By the definition, ( H ∘ m ) U has a pendant vertex x.

Lemma 3.1. If H is a basic graph, then ( H ∘ m ) U is also a basic graph.

Proof. For any i , j ∈ { 1,2, ⋯ , n } , if i ≠ j , as H is a basic graph, then N H ( v i ) ≠ N H ( v j ) . by the definition of the graph ( H ∘ m ) U , we have N ( H ∘ m ) U ( v i s ) = N H ( v i ) or N H ( v i ) ∪ { y } , either way, we have N ( H ∘ m ) U ( v i s ) ≠ N ( H ∘ m ) U ( v j t ) ( 1 ≤ s ≤ m i , 1 ≤ t ≤ m j ). If i = j and m i = 2 , by the construction of the graph ( H ∘ m ) U , we have y ∈ N ( H ∘ m ) U ( v i 1 ) and y ∉ N ( H ∘ m ) U ( v i 2 ) ; x ∈ N ( H ∘ m ) U ( y ) and x ∉ N ( H ∘ m ) U ( v ) for all v ( ≠ y ) ∈ V ( ( H ∘ m ) U ) ; N ( H ∘ m ) U ( x ) = { y } and N ( H ∘ m ) U ( v ) ≠ { y } for all v ( ≠ x ) ∈ V ( ( H ∘ m ) U ) (because H has no isolated vertices). In a word, any two vertices in ( H ∘ m ) U don’t have the same neighborhoods. Therefore, ( H ∘ m ) U is a basic graph. □

For the convenience of drawing, when m i = 2 , we use a hollow circle to indicate two vertices v i 1 and v i 2 , which have the same neighborhoods in H ∘ m , the vertex y is adjacent to v i 1 but not adjacent to v i 2 , and we use a black dot to indicate exactly one vertex. For example, the graph ( H ∘ m ) U is depicted in

Since there are multiple choices for the vector m and the subset U, there are also multiple choices for the graph ( H ∘ m ) U , represented by B ( H ) as the set of all graphs ( H ∘ m ) U .

Theorem 1. Let G be a graph without isolated vertices but with pendant vertices,

r ( G ) = 7 if and only if G ∈ M ( Ω 5 ) , where Ω 5 = ∪ H ∈ Λ 5 B ( H ) , Λ 5 is the same thing as Lemma 2.4.

Proof. Without loss of generality, we assume that G is a basic graph. Let H be the induced subgraph of G obtained by deleting the pendant vertex x together with the vertex y adjacent to it. By Lemma 2.5, we have r ( H ) = 5 . Furthermore, H does not have isolated vertices (if not, then the G contains at least an isolated vertex or two pendant vertices all adjacent to y, so G is not a connected graph, or G is not a basic graph, which is a contradiction). Then by Lemma 2.4, H ∈ M ( Λ 5 ) . Let H = K ∘ m , where m = ( m 1 , m 2 , ⋯ , m n ) is a vector of positive integers, and K ∈ Λ 5 . If m i ≥ 3 , then there exists s , t ∈ { 1,2, ⋯ , m i } such that N G ( v i s ) = N G ( v i t ) (since N G ( v i s ) = N H ( v i ) or N H ( v i ) ∪ { y } ). If m i = 2 , v i 1 and v i 2 are all adjacent to y or none are adjacent to y, then N G ( v i 1 ) = N G ( v i 2 ) , However, G is a basic graph, this is a contradiction. So m i ≤ 2 , one and only one of the two vertices v i 1 and v i 2 is adjacent to y when m i = 2 . Therefore, we conclude that G ∈ ∪ H ∈ Λ 5 B ( H ) . □

A graph G is called a basic extremal graph of rank k. Let it be a basic graph of rank k, and it is not a proper vertex-induced subgraph of any basic graphs of rank k. When we study the graph of rank k, we just need to find out the basic extremal graph of rank k. Obviously, K 2 is a basic extremal graph of rank 2, let’s say Γ 2 = { K 2 } . K 3 is a basic extremal graph of rank 3, let’s say Γ 3 = { K 3 } . H 6 , H 7 and H 8 (as shown in

Γ 5 = { G 1 , G 2 , G 3 , G 11 , G 13 , G 17 , G 19 , G 24 } .

Obviously, in Γ i ( i = 2 , 3 , 4 ) , every graph is the vertex-induced subgraph of a certain graph in Γ 5 .

Let H be a a basic graph of rank 5, then all graphs in the set B ( H ) are basic graphs with pendant vertices and r ( G ) = 7 . Let ( H ∘ m ) U ∈ B ( H ) , m = ( m 1 , m 2 , ⋯ , m n ) , and every vector m i = 1 or 2 ( i = 1 , 2 , ⋯ , n ). If some vectors m i ≠ 2 , then ( H ∘ m ) U can’t be a basic extremal graph of rank 7, because it is a proper vertex-induced subgraph of ( H ∘ m ′ ) ∅ , where m ′ = ( 2,2, ⋯ ,2 ) and ∅ is empty set. Particularly, let’s say ( H ∘ m ′ ) ∅ = ℍ . Easy to prove, if H is a basic extremal graph of rank 5, then ℍ is a basic extremal graph with pendant vertices and r ( G ) = 7 . Hence we have the following theorem.

Theorem 2. Let G be a graph without isolated vertices but with pendant vertices, then r ( G ) ≤ 7 if and only if G ∈ M ( Δ ) , where Δ is the set of all vertex-induced subgraphs of graphs in set Θ = { ℍ | H ∈ Γ 5 } .

Proof. By H ∈ Γ 5 , we know the rank of H is 5. By the definition of ℍ and lemma 2.5, we know its rank is 7. Hence the rank of every graph is less than or equal to 7 in set Δ . On the contrary, let G be a graph without isolated vertices but with pendant vertices, and r ( G ) = k ≤ 7 . Similar to the proof of theorem 1,

we have G ∈ M ( Ω k − 2 ) , where Ω k − 2 = ∪ H ∈ Λ k − 2 B ( H ) . Because every graph in

Λ k − 2 is the vertex-induced subgraph of a certain graph in Γ k − 2 , and every graph in Γ k − 2 ( k = 4,5,6,7 ) is the vertex-induced subgraph of a certain graph in Γ 5 . On the other hand, every graph in B ( H ) is the vertex-induced subgraph of ℍ . So G ∈ M ( Δ ) . □

By using the operation of multiplication of vertices, a characterization for graph G with pendant vertices and r ( G ) = 7 is shown, and then a characterization for graph G with pendant vertices and r ( G ) less than or equal to 7 is shown.

This work is supported by National Natural Science Foundation of China (11561056, 11661066), 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., Gao, S. and Li, D.Y. (2020) Graphs with Pendant Vertices and r (G) ≤ 7. Journal of Applied Mathematics and Physics, 8, 240-246. https://doi.org/10.4236/jamp.2020.82019