The Triangle-Free Graphs with Rank 6

DOI10.3770/J.ISSN:2095-2651.2014.05.002zbMATH Open1324.05124arXiv1301.0374OpenAlexW1589497369MaRDI QIDQ5260128FDOQ5260128

Authors: Long Wang, Yizheng Fan, Yi Wang 

Publication date: 29 June 2015

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.

Full work available at URL: https://arxiv.org/abs/1301.0374

zbMATH Keywords

ranktriangle-free graphsnullity

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)

Cited In (5)

• Triangle-free graphs with six non-zero eigenvalues
• Title not available (Why is that?)
• Maximal sets of triangle-factors onv = 6m vertices
• Square-Free Graphs with No Six-Vertex Induced Path
• On the characterization of digraphs with given rank

This page was built for publication: The Triangle-Free Graphs with Rank 6

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5260128)