| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4603683 | Linear Algebra and its Applications | 2007 | 7 Pages |
Abstract
Let G be a graph of order n and rank(G) denotes the rank of its adjacency matrix. Clearly, . In this paper we characterize all graphs G such that or n + 2. Also for every integer n ⩾ 5 and any k, 0 ⩽ k ⩽ n, we construct a graph G of order n, such that .
Related Topics
Physical Sciences and Engineering
Mathematics
Algebra and Number Theory
