Title of article
Maximum order of trees and bipartite graphs with a given rank
Author/Authors
Ghorbani، نويسنده , , E. and Mohammadian، نويسنده , , A. and Tayfeh-Rezaie، نويسنده , , B.، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2012
Pages
4
From page
3498
To page
3501
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.
Keywords
Rank , Tree , bipartite graph , Adjacency matrix
Journal title
Discrete Mathematics
Serial Year
2012
Journal title
Discrete Mathematics
Record number
1600167
Link To Document