On problems and conjectures on adjointly equivalent graphs
From MaRDI portal
Publication:556853
DOI10.1016/J.DISC.2005.02.009zbMATH Open1063.05054OpenAlexW2027736683WikidataQ123010501 ScholiaQ123010501MaRDI QIDQ556853FDOQ556853
Authors: Haixing Zhao, Xueliang Li, Ru Ying Liu 
Publication date: 23 June 2005
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2005.02.009
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
Coloring of graphs and hypergraphs (05C15) Paths and cycles (05C38) Structural characterization of families of graphs (05C75)
Cites Work
- Graph theory
- On the minimum real roots of the \(\sigma\)-polynomials and chromatic uniqueness of graphs
- Chromaticity of some families of dense graphs
- A new method for proving chromatic uniqueness of graphs
- Adjoint polynomials and chromatically unique graphs
- Graphs with chromatic polynomial \(\sum_{l\leqslant m_0}\binom l{m_0-l} (\lambda)_l\)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
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)
