(P_5 )-factorization of symmetric complete bipartite multi digraph

U. S. Rajput, U. S. Rajput, Bal Govind Shukla

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...

Full Text: PDF

How to Cite this Article:

U. S. Rajput, U. S. Rajput, Bal Govind Shukla, (P_5 )-factorization of symmetric complete bipartite multi digraph, Journal of Mathematical and Computational Science, Vol 2, No 3 (2012), 617-623

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.

J. Math. Comput. Sci.

ISSN: 1927-5307

Editorial Office: jmcs@scik.org

 

Copyright ©2019 JMCS