Isomorphisms of circulant digraphs of degree 3 (Q1919351): Difference between revisions
From MaRDI portal
Removed claims |
Set OpenAlex properties. |
||
(3 intermediate revisions by 3 users not shown) | |||
Property / author | |||
Property / author: Qiong Xiang Huang / rank | |||
Normal rank | |||
Property / reviewed by | |||
Property / reviewed by: András Ádám / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Isomorphism of circulant graphs and digraphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Circulants and their connectivities / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Graphs with circulant adjacency matrices / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3469128 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A note on Adam's conjecture / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A survey: Hamiltonian cycles in Cayley graphs / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1007/bf02662186 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2017193015 / rank | |||
Normal rank |
Latest revision as of 10:51, 30 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Isomorphisms of circulant digraphs of degree 3 |
scientific article |
Statements
Isomorphisms of circulant digraphs of degree 3 (English)
0 references
24 September 1996
0 references
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.
0 references
circulant digraphs
0 references
graph pairs
0 references
isomorphism
0 references
automorphisms
0 references