Two-graphs and NSSDs: an algebraic approach
From MaRDI portal
Publication:2026326
Recommendations
Cites work
- Coalesced and embedded nut graphs in singular graphs
- Complete graphs with zero diagonal inverse
- Graphs with a common eigenvalue deck
- scientific article; zbMATH DE number 3685526 (Why is no real title available?)
- scientific article; zbMATH DE number 1248194 (Why is no real title available?)
- Necessary and sufficient conditions for a Hamiltonian graph
- Non-singular graphs with a singular deck
- On the inverse of the adjacency matrix of a graph
- Rank-preserving diagonal completions of a matrix
- Regular two-graphs on 36 vertices
- The adjacency matrices of complete and nutful graphs
- The regular two-graph on 276 vertices
- Two-Graphs, Switching Classes and Euler Graphs are Equal in Number
Cited in
(3)
This page was built for publication: Two-graphs and NSSDs: an algebraic approach
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2026326)