A class of vertex-transitive digraphs. II

DOI10.1016/0095-8956(82)90009-0zbMath0497.05033OpenAlexW1999634453MaRDI QIDQ1170197

Chong-Yun Chao, Jacqueline G. Wells

Publication date: 1982

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0095-8956(82)90009-0

zbMATH Keywords

circulant digraphPolya's theoremself-complementarycyclic permutation group

Mathematics Subject Classification ID

Enumeration in graph theory (05C30) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Directed graphs (digraphs), tournaments (05C20)

Related Items (3)

On digraphs with circulant adjacent matrices ⋮ Some identities for enumerators of circulant graphs ⋮ On labeled vertex-transitive digraphs with a prime number of vertices

Cites Work

• Unnamed Item
• Unnamed Item
• Point-symmetric graphs and digraphs of prime order and transitive permutation groups of prime degree
• Isomorphism of circulant graphs and digraphs
• A class of vertex-transitive digraphs
• A class of self-complementary vertex-transitive digraphs
• Self-Complementary Generalized Orbits of a Permutation Group
• Isomorphism problem for a class of point-symmetric structures
• On Groups and Graphs
• Graphs with circulant adjacency matrices
• On the Classification of Symmetric Graphs with a Prime Number of Vertices
• On the Number of Self-Complementary Graphs and Digraphs

This page was built for publication: A class of vertex-transitive digraphs. II