Isomorphism criterion for monomial graphs

DOI10.1002/jgt.20055zbMath1069.05052OpenAlexW4247754943MaRDI QIDQ4676591

Vasyl Dmytrenko, Raymond Viglione, Felix Lazebnik

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)

Related Items (4)

Connectivity of some algebraically defined digraphs ⋮ On the girth of the bipartite graph \(D(k, q)\) ⋮ A Result on Polynomials Derived Via Graph Theory ⋮ On monomial graphs of girth eight

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