On the isomorphism problem for a family of cubic metacirculant graphs

DOI10.1016/0012-365X(94)00100-WMaRDI QIDQ1916397zbMATH OpenFDO

Authors 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 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)

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

Cites work

• scientific article; zbMATH DE number 3933107 (Why is no real title available?)
• scientific article; zbMATH DE number 3943850 (Why is no real title available?)
• scientific article; zbMATH DE number 3754731 (Why is no real title available?)
• scientific article; zbMATH DE number 3349883 (Why is no real title available?)
• A Construction for Vertex-Transitive Graphs
• 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)