Non-Cayley-isomorphic self-complementary circulant graphs

DOI<link itemprop=identifier href="https://doi.org/10.1002/1097-0118(200006)34:2<128::AID-JGT2>3.0.CO;2-I" /><128::AID-JGT2>3.0.CO;2-I 10.1002/1097-0118(200006)34:2<128::AID-JGT2>3.0.CO;2-IzbMath0962.05025OpenAlexW4239274420MaRDI QIDQ4489488

Valery A. Liskovets, Reinhard Pöschel

Publication date: 13 June 2001

Full work available at URL: https://doi.org/10.1002/1097-0118(200006)34:2<128::aid-jgt2>3.0.co;2-i

zbMATH Keywords

self-complementary graphscirculant graphCayley isomorphy property

Mathematics Subject Classification ID

Enumeration in graph theory (05C30) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Directed graphs (digraphs), tournaments (05C20) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Related Items (10)

Homogeneous factorisations of complete multipartite graphs ⋮ New constructions of self-complementary Cayley graphs ⋮ Some identities for enumerators of circulant graphs ⋮ Almost self-complementary circulant graphs. ⋮ On finite self-complementary metacirculants ⋮ SELF-COMPLEMENTARY VERTEX-TRANSITIVE GRAPHS OF ORDER A PRODUCT OF TWO PRIMES ⋮ Non-Cayley-isomorphic self-complementary circulant graphs ⋮ NEW CONSTRUCTIONS OF SELF-COMPLEMENTARY CAYLEY GRAPHS ⋮ Homogeneous factorisations of graphs and digraphs ⋮ On partitioning the orbitals of a transitive permutation group

Cites Work

• The existence of selfcomplementary circulant graphs
• Isomorphism problem for relational structures with a cyclic automorphism
• Ádám's conjecture is true in the square-free case
• Selbstkomplementäre Graphen
• A class of self-complementary vertex-transitive digraphs
• Non-Cayley-isomorphic self-complementary circulant graphs
• Self-complementary graphs
• Constructions of self-complementary circulants with no multiplicative isomorphisms

This page was built for publication: Non-Cayley-isomorphic self-complementary circulant graphs