| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4601665 | Linear Algebra and its Applications | 2011 | 6 Pages |
Abstract
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.
Related Topics
Physical Sciences and Engineering
Mathematics
Algebra and Number Theory
