| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 6423430 | Discrete Mathematics | 2012 | 4 Pages |
Abstract
The rank of a graph is that of its adjacency matrix. A graph is called reduced if it has no isolated vertices and no two vertices with the same set of neighbors. We determine the maximum order of reduced trees as well as bipartite graphs with a given rank and characterize those graphs achieving the maximum order.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
E. Ghorbani, A. Mohammadian, B. Tayfeh-Rezaie,