| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4600119 | Linear Algebra and its Applications | 2013 | 9 Pages |
Abstract
The rank of a graph G is defined to be the rank of its adjacency matrix. A connected graph G of rank n is called long if it has maximum diameter among all connected graphs with rank n. In this paper, we characterize the long graphs of rank n, for n an arbitrary positive integer.
Related Topics
Physical Sciences and Engineering
Mathematics
Algebra and Number Theory
