Vertex-transitive direct products of graphs (Q1753082)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 6873161
Language Label Description Also known as
default for all languages
No label defined
    English
    Vertex-transitive direct products of graphs
    scientific article; zbMATH DE number 6873161

      Statements

      Vertex-transitive direct products of graphs (English)
      0 references
      0 references
      0 references
      25 May 2018
      0 references
      Summary: It is known that for graphs \(A\) and \(B\) with odd cycles, the direct product \(A\times B\) is vertex-transitive if and only if both \(A\) and \(B\) are vertex-transitive. But this is not necessarily true if one of \(A\) or \(B\) is bipartite, and until now there has been no characterization of such vertex-transitive direct products. We prove that if \(A\) and \(B\) are both bipartite, or both non-bipartite, then \(A\times B\) is vertex-transitive if and only if both \(A\) and \(B\) are vertex-transitive. Also, if \(A\) has an odd cycle and \(B\) is bipartite, then \(A\times B\) is vertex-transitive if and only if both \(A\times K_2\) and \(B\) are vertex-transitive.
      0 references
      graph theory
      0 references
      graph direct product
      0 references
      bipartite graphs
      0 references
      vertex-transitive graphs
      0 references

      Identifiers