Cayley graphs and \(G\)-graphs: some applications (Q651882): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
Normalize DOI. |
||
(2 intermediate revisions by 2 users not shown) | |||
Property / DOI | |||
Property / DOI: 10.1016/j.jsc.2011.08.016 / rank | |||
Property / cites work | |||
Property / cites work: Q4071273 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3024729 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A New Property of Hamming Graphs and Mesh of d-ary Trees / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: \(G\)-graphs: a new representation of groups / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The connectivity of line-graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3348930 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q2716030 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3751608 / rank | |||
Normal rank | |||
Property / DOI | |||
Property / DOI: 10.1016/J.JSC.2011.08.016 / rank | |||
Normal rank |
Latest revision as of 23:49, 9 December 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Cayley graphs and \(G\)-graphs: some applications |
scientific article |
Statements
Cayley graphs and \(G\)-graphs: some applications (English)
0 references
19 December 2011
0 references
Let \(G\) be a group and \(S\) a set of generators of \(G\). The \(G\)-graph \(\Phi(G;S)\) is constructed as follows: The vertices of \(\Phi(G;S)\) are the distinct (right) cosets of the cyclic subgroups generated by the elements of \(S\) and two such vertices are adjacent if the right cosest they represent have non-empty intersection. The graph obtained from \(\Phi(G;S)\) by deleting all loops is also called a \(G\)-graph and is denoted by \({\overline{\Phi}}(G;S)\). The authors establish a sufficient condition for a \(G\)-graph \({\overline{\Phi}}(G;S)\) to be a Cayley graph. They use this connection of \(G\)-graphs with Cayley graphs to determine new classes of Cayley graphs that are hamiltonian.
0 references
computational group theory
0 references
graph representation of a group
0 references
Cayley graphs
0 references
G-graphs
0 references