No label defined (Q3971996)

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 15352
Language Label Description Also known as
default for all languages
No label defined
    English
    No label defined
    scientific article; zbMATH DE number 15352

      Statements

      0 references
      0 references
      25 June 1992
      0 references
      tensor products of graphs
      0 references
      Cartesian product
      0 references
      decomposition
      0 references
      Hamilton cycles
      0 references
      one-factorization
      0 references
      [For the entire collection see Zbl 0698.00017.] The tensor product \(G\otimes H\) of graphs \(G\) and \(H\) is defined to have vertex set the Cartesian product of the vertex sets of \(G\) and \(H\); \((u,v)\) is adjacent to \((u',v')\) if and only if \(uu'\) is an edge in \(G\) and \(vv'\) is an edge in \(H\). The authors use Frobenius groups to prove results about factorizations of tensor products. They prove that if \(H\) is regular of degree \(n\) and \(G\) has a decomposition into Hamilton cycles then \(G\otimes H\) has a one-factorization. Moreover, they show that \(K_ n\otimes H\) has a one-factorization when \(n\) is a prime power and \(H\) is \(n\)-regular (when \(n\) is a power of 2, this is not covered by the earlier result). The reader may wish to consult the paper of \textit{J. D. Horton} [J. Comb. Theory, Ser. A 39, 117-131 (1985; Zbl 0584.05056)] in which it was shown that if \(G\) has a one-factorization and \(H\) is regular then \(G\otimes H\) has a one-factorization.
      0 references

      Identifiers