Maximum order of triangle-free graphs with a given rank
Combinatorics
2014-04-15 v1
Abstract
The rank of a graph is defined to be the rank 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 triangle-free graphs with a given rank and characterize all such graphs achieving the maximum order.
Keywords
Cite
@article{arxiv.1404.3553,
title = {Maximum order of triangle-free graphs with a given rank},
author = {E. Ghorbani and A. Mohammadian and B. Tayfeh-Rezaie},
journal= {arXiv preprint arXiv:1404.3553},
year = {2014}
}
Comments
14 pages, 4 figures