When is Cartesian product a Cayley graph?
Edward Dobson, Ademir Hujdurović, Wilfried Imrich, Ronald Ortner
Abstract
Open-access reader
Edward Dobson, Ademir Hujdurović, Wilfried Imrich, Ronald Ortner
Abstract
Open-access reader
A graph is said to be {\it Cayley} graph if its automorphism group admits a regular subgroup. Automorphisms of the Cartesian product of graphs are well understood, and it is known that Cartesian product of Cayley graphs is a Cayley graph. It is natural to ask the reverse question, namely whether all the factors of Cartesian product that is a Cayley graph have to be Cayley graphs. The main purpose of this paper is to initiate the study of this question.
A significance statement is not available in the OpenAlex record.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
A graph is said to be {\it Cayley} graph if its automorphism group admits a regular subgroup. Automorphisms of the Cartesian product of graphs are well understood, and it is known that Cartesian product of Cayley graphs is a Cayley graph. It is natural to ask the reverse question, namely whether all the factors of Cartesian product that is a Cayley graph have to be Cayley graphs. The main purpose of this paper is to initiate the study of this question.
Key concepts: Cayley graph, Cartesian product, Vertex-transitive graph, Cayley's theorem, Automorphism, Cayley transform, Mathematics, Combinatorics