A characterization of graphs with rank 5
Journal
Linear Algebra and Its Applications
Journal Volume
436
Journal Issue
11
Pages
4241-4250
Date Issued
2012
Author(s)
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 G with rank 5? or equivalently, what is the structure of a connected n-vertex graph G whose adjacency matrix has nullity n - 5? In this paper, we completely characterize connected graphs G whose adjacency matrix has rank 5. © 2012 Elsevier Inc. All rights reserved.
Type
journal article