On path factorization of complete multipartite multigraphs

Authors

  • Wu, Zhanggui
  • Du, Beiliang

Abstract

It is shown that the necessary conditions mn = 0 (mod k) and λ(m - 1)nk = 0 (mod 2(k - 1)) for λ(Km * K̄n), the complete multipartite multigraphs, to have a Pk-factorization are sufficient when k = p + 1 and p is prime. This answers the conjecture of Yu on Pk-factorizations of complete multipartite multigraphs, when k = prime+1.

Published

2010-05-09

How to Cite

Wu, Zhanggui, & Du, Beiliang. (2010). On path factorization of complete multipartite multigraphs. Utilitas Mathematica, 81. Retrieved from https://utilitasmathematica.com/index.php/Index/article/view/728

Issue

Section

Articles

Citation Check

Most read articles by the same author(s)

Obs.: This plugin requires at least one statistics/report plugin to be enabled. If your statistics plugins provide more than one metric then please also select a main metric on the admin's site settings page and/or on the journal manager's settings pages.