Explicit Cayley covers of Kautz digraphs (Q540110): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
Property / review text | |||
Summary: Given a finite set \(V\) and a set \(S\) of permutations of \(V\), the group action graph \(\text{GAG}(V, S)\) is the digraph with vertex set \(V\) and arcs \((v, v^\sigma)\) for all \(v\in V\) and or \(\sigma\in S\). Let \(\langle S\rangle\) be the group generated by \(S\). The Cayley digraph \(\text{Cay}(\langle S\rangle, S)\) is called a Cayley cover of \(\text{GAG}(V, S)\). We define the Kautz digraphs as group action graphs and give an explicit construction of the corresponding Cayley cover. This is an answer to a problem posed by \textit{Heydemann} in 1996. | |||
Property / review text: Summary: Given a finite set \(V\) and a set \(S\) of permutations of \(V\), the group action graph \(\text{GAG}(V, S)\) is the digraph with vertex set \(V\) and arcs \((v, v^\sigma)\) for all \(v\in V\) and or \(\sigma\in S\). Let \(\langle S\rangle\) be the group generated by \(S\). The Cayley digraph \(\text{Cay}(\langle S\rangle, S)\) is called a Cayley cover of \(\text{GAG}(V, S)\). We define the Kautz digraphs as group action graphs and give an explicit construction of the corresponding Cayley cover. This is an answer to a problem posed by \textit{Heydemann} in 1996. / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 05E18 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 05C25 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 05C20 / rank | |||
Normal rank | |||
Property / zbMATH DE Number | |||
Property / zbMATH DE Number: 5903035 / rank | |||
Normal rank |
Revision as of 10:00, 1 July 2023
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Explicit Cayley covers of Kautz digraphs |
scientific article |
Statements
Explicit Cayley covers of Kautz digraphs (English)
0 references
1 June 2011
0 references
Summary: Given a finite set \(V\) and a set \(S\) of permutations of \(V\), the group action graph \(\text{GAG}(V, S)\) is the digraph with vertex set \(V\) and arcs \((v, v^\sigma)\) for all \(v\in V\) and or \(\sigma\in S\). Let \(\langle S\rangle\) be the group generated by \(S\). The Cayley digraph \(\text{Cay}(\langle S\rangle, S)\) is called a Cayley cover of \(\text{GAG}(V, S)\). We define the Kautz digraphs as group action graphs and give an explicit construction of the corresponding Cayley cover. This is an answer to a problem posed by \textit{Heydemann} in 1996.
0 references