On problems and conjectures on adjointly equivalent graphs
From MaRDI portal
Recommendations
- Proof of conjectures on adjacency eigenvalues of graphs
- scientific article; zbMATH DE number 1222839
- On Ádám's conjecture for circulant graphs
- Adjacency properties of graphs and a conjecture of Erdős
- scientific article; zbMATH DE number 2108155
- scientific article; zbMATH DE number 1744094
- On conjugate adjacency matrices of a graph
- On an adjacency property of almost all graphs
- On graphs and \(M\)-equivalence
Cites work
- scientific article; zbMATH DE number 4091530 (Why is no real title available?)
- scientific article; zbMATH DE number 1563918 (Why is no real title available?)
- scientific article; zbMATH DE number 1744094 (Why is no real title available?)
- scientific article; zbMATH DE number 1744096 (Why is no real title available?)
- A new method for proving chromatic uniqueness of graphs
- Adjoint polynomials and chromatically unique graphs
- Chromaticity of some families of dense graphs
- Graph theory
- Graphs with chromatic polynomial \(\sum_{l\leqslant m_0}\binom l{m_0-l} (\lambda)_l\)
- On the minimum real roots of the \(\sigma\)-polynomials and chromatic uniqueness of graphs
Cited in
(3)
This page was built for publication: On problems and conjectures on adjointly equivalent graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q556853)
