Triangle-free graphs with six non-zero eigenvalues
From MaRDI portal
Recommendations
Cites work
- A characterization of graphs with rank 4
- A characterization of graphs with rank 5
- Bipartite graphs with at most six non-zero eigenvalues
- scientific article; zbMATH DE number 3717357 (Why is no real title available?)
- On graphs with exactly two positive eigenvalues
- On the nullity of graphs
- Positive and negative inertia index of a graph
- The Triangle-Free Graphs with Rank 6
Cited in
(7)- Triangle-free graphs with no six-vertex induced path
- scientific article; zbMATH DE number 11798 (Why is no real title available?)
- Characterization of a class of triangle-free graphs with a certain adjacency property
- Triply existentially complete triangle-free graphs
- Square-Free Graphs with No Six-Vertex Induced Path
- Triangle-free graphs with three positive eigenvalues
- On triangle-free graphs with rank 7
This page was built for publication: Triangle-free graphs with six non-zero eigenvalues
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5887673)