(P_5 )-factorization of symmetric complete bipartite multi digraph
Abstract
P2p-factorization of a complete bipartite graph, for an integer, was studied by Wang [1]. Further, Beiliang [2] extended the work of Wang [1], and studied the -factorization of complete bipartite multigraphs...
Copyright © 2012 U. S. Rajput, U. S. Rajput, Bal Govind Shukla. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
Cite this article
U. S. Rajput, U. S. Rajput, B. G. Shukla, (P_5 )-factorization of symmetric complete bipartite multi digraph, J. Math. Comput. Sci. 2 (2012), 617–623.
BibTeX
@article{Rajput2012,
author = {Rajput, U. S. and Rajput, U. S. and Shukla, Bal Govind},
title = {(P_5 )-factorization of symmetric complete bipartite multi digraph},
journal = {J. Math. Comput. Sci.},
volume = {2},
year = {2012},
pages = {617--623},
doi = {}
}