On the isomorphism problem for a family of cubic metacirculant graphs

DOI10.1016/0012-365X(94)00100-WzbMath0858.05077MaRDI QIDQ1916397

Ngo Dac Tan

Publication date: 11 September 1996

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

zbMATH Keywords

algorithmautomorphism groupcirculant graphsgeneralized Petersen graphsmetacirculant graphsisomorphism checking

Mathematics Subject Classification ID

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

Related Items (3)

Some results on the lexicographic product of vertex-transitive graphs ⋮ On half-transitive metacirculant graphs of prime-power order ⋮ Products of circulant graphs are metacirculant.

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On cubic metacirculant graphs
• A Construction for Vertex-Transitive Graphs

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