The Triangle-Free Graphs with Rank 6

DOI10.3770/J.ISSN:2095-2651.2014.05.002MaRDI QIDQ5260128zbMATH OpenOpenAlexFDO

Authors Long Wang, Yizheng Fan, Yi Wang

Publication date 29 June 2015

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)

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.

Cited in

(6)

• Triangle-free graphs with six non-zero eigenvalues
• scientific article; zbMATH DE number 5279372 (Why is no real title available?)
• On triangle-free graphs with rank 7
• 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)