arXiv Analytics

Sign in

arXiv:1301.0374 [math.CO]AbstractReferencesReviewsResources

The triangle-free graphs with rank 6

Long Wang, Yi-Zheng Fan, Yi Wang

Published 2013-01-03, updated 2013-01-05Version 2

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.

Categories: math.CO
Subjects: 05C50
Related articles: Most relevant | Search more
arXiv:math/0201211 [math.CO] (Published 2002-01-22)
The kernel of the adjacency matrix of a rectangular mesh
arXiv:1508.05281 [math.CO] (Published 2015-08-21)
Directed strongly walk-regular graphs
arXiv:1706.03298 [math.CO] (Published 2017-06-11)
Polynomial Relations Between Matrices of Graphs

Links

Toolbox