Isomorphism classes of cycle permutation graphs

DOI10.1016/0012-365X(92)90137-5zbMath0772.05083OpenAlexW1980296652MaRDI QIDQ1199480

Jaeun Lee, Jin Ho Kwok

Publication date: 16 January 1993

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

Full work available at URL: https://doi.org/10.1016/0012-365x(92)90137-5

zbMATH Keywords

dihedral groupsymmetric groupisomorphism classescycle permutation graph

Mathematics Subject Classification ID

Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Structural characterization of families of graphs (05C75) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Related Items (3)

Enumeration of graph embeddings ⋮ Regular graph coverings whose covering transformation groups have the isomorphism extension property ⋮ Construction of discrete structures, especially isomers

Cites Work

• On cycle permutation graphs
• On natural isomorphisms of cycle permutation graphs
• Counting some finite-fold coverings of a graph
• Generating all graph coverings by permutation voltage assignments
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Isomorphism classes of cycle permutation graphs