NewEvery arXiv paper, its researchers & institutions — mapped.
paper

The triangle-free graphs with rank 6

arXiv:1301.0374 · doi:10.3770/j.issn:2095-2651.2014.05.002

Abstract

The rank of a graph G is defined to be the rank of its adjacency matrix A(G). In this paper we characterize all connected triangle-free graphs with rank 6.