P→5-factorization of symmetric complete bipartite multi-digraphs

Authors

  • Wang, Jian
  • Du, Beiliang

Abstract

It is shown that a necessary and sufficient condition for the existence of a P5-factorization of symmetric complete bipartite multi-digraph λKm,n* is (1) 3n ≥ 2m, (2) 3m ≥ 2n, (3) m + n ≡ 0 (mod 5), and (4) 5λmn/[2(m + n)] is an integer.

Published

2005-06-09

How to Cite

Wang, Jian, & Du, Beiliang. (2005). P→5-factorization of symmetric complete bipartite multi-digraphs. Utilitas Mathematica, 68. Retrieved from https://utilitasmathematica.com/index.php/Index/article/view/363

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.