Loading...

Commuting decompositions of complete graphs

Akbari, S ; Sharif University of Technology | 2007

187 Viewed
  1. Type of Document: Article
  2. DOI: 10.1002/jcd.20112
  3. Publisher: 2007
  4. Abstract:
  5. We say that two graphs G and H with the same vertex set commute if their adjacency matrices commute. In this article, we show that for any natural number r, the complete multigraph Knr is decomposable into commuting perfect matchings if and only if n is a 2-power. Also, it is shown that the complete graph Kn is decomposable into commuting Hamilton cycles if and only if n is a prime number. © 2006 Wiley Periodicals, Inc
  6. Keywords:
  7. Adjacency matrices of graphs ; Graph decompositions
  8. Source: Journal of Combinatorial Designs ; Volume 15, Issue 2 , 2007 , Pages 133-142 ; 10638539 (ISSN)
  9. URL: https://onlinelibrary.wiley.com/doi/10.1002/jcd.20112