Isomorphism criterion for monomial graphs

DOI10.1002/JGT.20055MaRDI QIDQ4676591zbMATH OpenOpenAlexFDO

Authors Vasyl Dmytrenko, Felix Lazebnik, Raymond Viglione

Publication date 4 May 2005

Published in Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/jgt.20055

zbMATH Keywords

graph isomorphismalgebraic constructionsnumber of complete bipartite subgraphs

Mathematics Subject Classification ID

Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Recommendations

• Monomial graphs and generalized quadrangles
• Proof of a conjecture on monomial graphs
• Bipartite graphs and their endomorphism monoids
• On monomial graphs of girth eight
• On the uniqueness of some girth eight algebraically defined graphs. II

Cited in

(6)

• On the girth of the bipartite graph D(k, q)
• Nonisomorphic two-dimensional algebraically defined graphs over \(\mathbb{R}\)
• On monomial graphs of girth eight
• Connectivity of some algebraically defined digraphs
• A result on polynomials derived via graph theory
• Properties of algebraically defined edge-colored graphs

This page was built for publication: Isomorphism criterion for monomial graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4676591)