On automorphisms of direct products of Cayley graphs on abelian groups (Q2040002): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Hall's and Kőnig's theorem in graphs and hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Classification of Symmetric Graphs with a Prime Number of Vertices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4882944 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4770422 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A CHARACTERIZATION OF STABLE GRAPHS ON A MAXIMUM(MINIMUM) NUMBER OF EDGES / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2716030 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3005852 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The rank and size of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3424788 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stability of circulant graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The composition of graphs / rank
 
Normal rank

Latest revision as of 03:14, 26 July 2024

scientific article
Language Label Description Also known as
English
On automorphisms of direct products of Cayley graphs on abelian groups
scientific article

    Statements

    On automorphisms of direct products of Cayley graphs on abelian groups (English)
    0 references
    6 July 2021
    0 references
    Summary: Let \(X\) and \(Y\) be connected Cayley graphs on abelian groups, such that no two distinct vertices of \(X\) have exactly the same neighbours, and the same is true about \(Y\). We show that if the number of vertices of \(X\) is relatively prime to the number of vertices of \(Y\), then the direct product \(X \times Y\) has only the obvious automorphisms (namely, the ones that come from automorphisms of its factors \(X\) and \(Y)\). This was not previously known even in the special case where \(Y = K_2\) has only two vertices. The proof of this special case is short and elementary. The general case follows from the special case by standard arguments.
    0 references
    canonical bipartite double cover of a graph
    0 references
    twin-free graph
    0 references
    0 references

    Identifiers