The triangle-free graphs with rank 6
classification
🧮 math.CO
keywords
rankgraphstriangle-freeadjacencycharacterizeconnecteddefinedgraph
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.