On the isomorphism problem for a family of cubic metacirculant graphs

DOI10.1016/0012-365X(94)00100-WzbMATH Open0858.05077MaRDI QIDQ1916397FDOQ1916397

Authors: Ngo Dac Tan 

Publication date: 11 September 1996

Published in: Discrete Mathematics (Search for Journal in Brave)

Recommendations

• A characterization of some cubic \((m,n)\)-metacirculant graphs
• On cubic metacirculant graphs
• Isomorphism Problem for Metacirculant Graphs of Order a Product of Distinct Primes

zbMATH Keywords

algorithmautomorphism groupcirculant graphsgeneralized Petersen graphsmetacirculant graphsisomorphism checking

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Cites Work

• A Construction for Vertex-Transitive Graphs
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• On cubic metacirculant graphs

Cited In (5)

• Cubic \((m,n)\)-metacirculant graphs which are not Cayley graphs
• Products of circulant graphs are metacirculant.
• Some results on the lexicographic product of vertex-transitive graphs
• On half-transitive metacirculant graphs of prime-power order
• Connectedness of cubic metacirculant graphs

This page was built for publication: On the isomorphism problem for a family of cubic metacirculant graphs

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