Isomorphisms of circulant digraphs of degree 3

DOI10.1007/BF02662186MaRDI QIDQ1919351zbMATH OpenOpenAlexFDO

Authors Zhihua Du, Qiongxiang Huang

Publication date 24 September 1996

Published in Applied Mathematics. Series B (English Edition) (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf02662186

zbMATH Keywords

automorphismscirculant digraphsgraph pairsisomorphism

Mathematics Subject Classification ID

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

Review text

The circulant directed graph with \(n\) vertices and with characteristic set \(S = \{s_1, s_2, \dots, s_k\}\) is denoted by \(C_n (S)\). An isomorphism \(f\) from \(C_n (S)\) to \(C_n (T)\) (where \(|S |= |T |)\) is called zero-preserving if \(f(0) = 0\); among these, \(f\) is said to be special if \((\forall i)\) \([f(i) \equiv \lambda i \pmod n]\) for a \(\lambda\) which is relatively prime to \(n\). In Theorem 1 the graph pairs \((C_n (S), C_n (T))\) are characterized for which any zero-preserving isomorphism from \(C_n (S)\) to \(C_n (T)\) is a special isomorphism. The main results of the paper (Theorems 2 and 3) concern the particular case \(k (= |S |) = 3\). They are stated after a sequence of lemmas. The (three-element) sets \(S\) for which there exists a zero-preserving non-special isomorphism from \(C_n (S)\) are completely determined. Some consequences of Theorem 1 for the automorphisms of \(C_n (S)\) are also derived.

Recommendations

• Isomorphisms of circulant digraphs
• On isomorphisms of circulant digraphs of bounded degree
• scientific article; zbMATH DE number 1153465
• Isomorphisms ofP3-graphs
• Publication:3197857
• P3-isomorphisms for graphs
• scientific article; zbMATH DE number 1750097
• On isomorphic factorizations of circulant graphs
• scientific article; zbMATH DE number 2188364
• A solution of the isomorphism problem for circulant graphs

Cites work

• A note on Adam's conjecture
• A survey: Hamiltonian cycles in Cayley graphs
• Circulants and their connectivities
• Graphs with circulant adjacency matrices
• scientific article; zbMATH DE number 4135988 (Why is no real title available?)
• Isomorphism of circulant graphs and digraphs

Cited in

(7)

• Characterization of \(c\)-circulant digraphs of degree two which are circulant
• Isomorphisms of circulant digraphs
• Ádám's conjecture is true in the square-free case
• Enumeration of the Ádám isomorphism classes of circulants. II
• scientific article; zbMATH DE number 3896962 (Why is no real title available?)
• scientific article; zbMATH DE number 1153465 (Why is no real title available?)
• Every graph is an induced isopart of a circulant

This page was built for publication: Isomorphisms of circulant digraphs of degree 3

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1919351)