A characterization of graphs with rank 4

作者：Chang Gerard J; Huang Liang Hao; Yeh Hong Gwa^*

来源：Linear Algebra and Its Applications, 2011, 434(8): 1793-1798.

DOI：10.1016/j.laa.2010.09.040

• Nullity
• Rank
• Adjacency matrix
• Graph
• Spectrum

The rank of a graph G is defined to be the rank of its adjacency matrix. In this paper, we consider the following problem: What is the structure of a connected graph with rank 4? This question has not yet been fully answered in the literature, and only some partial results are known. In this paper we resolve this question by completely characterizing graphs G whose adjacency matrix has rank 4.

• 出版日期2011-4-15
• 单位中央民族大学