Research Article
P_2k-Factorization Induced Network Flow
|
International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
|
| Volume 123 - Issue 18 |
| Published: August 2015 |
| Authors: U.S. Rajput, Bal Govind Shukla |
10.5120/ijca2015905737
|
U.S. Rajput, Bal Govind Shukla . P_2k-Factorization Induced Network Flow. International Journal of Computer Applications. 123, 18 (August 2015), 34-40. DOI=10.5120/ijca2015905737
@article{ 10.5120/ijca2015905737,
author = { U.S. Rajput,Bal Govind Shukla },
title = { P_2k-Factorization Induced Network Flow },
journal = { International Journal of Computer Applications },
year = { 2015 },
volume = { 123 },
number = { 18 },
pages = { 34-40 },
doi = { 10.5120/ijca2015905737 },
publisher = { Foundation of Computer Science (FCS), NY, USA }
}
%0 Journal Article
%D 2015
%A U.S. Rajput
%A Bal Govind Shukla
%T P_2k-Factorization Induced Network Flow%T
%J International Journal of Computer Applications
%V 123
%N 18
%P 34-40
%R 10.5120/ijca2015905737
%I Foundation of Computer Science (FCS), NY, USA
Abstract
P_k-factorizations of complete bipartite graph have been studied by several researchers. For even value of k, the spectrum problem is completely solved [6, 7]. Here in this paper we will obtain a feasible network flow of P_2k-factorization of a complete bipartite graph satisfying the conditions of P_2k-factorization. In this paper we construct the disjoint flow paths in P_2k-factorization of complete bipartite graph K_(m,n) (for k=1 and 2). We deduce that P_2k-factorization of complete bipartite graph is helpful in finding the disjoint flow paths in a compete bipartite graph K_(m,n) (m=n). The result can be generalized for any value of k with m=n.
References
- Beliang Du: P_2k-factorization of complete bipartite multigraph. Australasian Journal of Combinatorics 21(2000), 197 - 199.
- Du B and Wang J: P_(4k-1)-factorization of complete bipartite graphs. Science in China Ser. A Mathematics 48 (2005) 539 – 547.
- Ford L R, Fulkerson D R. “Maximum Flow through a Network”. Canadian journal of Mathematics 8:399(1956).
- Fulkerson D R ; “Flow Network and Combinatorial Operations Research”. Amer. Math. Monthly 73. 115-138(1966).
- Rajput U S and Shukla Bal Govind: P_9-factorization of complete bipartite graphs. Applied Mathematical Sciences, volume 5(2011), 921- 928.
- Rajput U S and Shukla Bal Govind: P_(4k+1)-factorization of complete bipartite graphs: Elixir Dis. Math. 45 (2012) 7893-7897.
- Ushio K: P_3-factorization of complete bipartite graphs. Discrete math.72 (1988) 361-366.
- Ushio K: G-designs and related designs, Discrete Math., 116(1993), 299-311.
- Wang H: P_2p-factorization of a complete bipartite graph, discrete math.120 (1993) 307-308.
- Wang J and Du B: P_5-factorization of complete bipartite graphs. Discrete math. 308 (2008) 1665 – 1673.
- Wang J: P_7-factorization of complete bipartite graphs. Australasian Journal of Combinatorics, volume 33 (2005), 129-137.
- Ushio K. Path-factorization of complete bipartite graphs, Discrete Math., 72(1988),361-366.
- Bondy J A and Murty U S R. Graph Theory with Applications, ( Macmillan, London and Basingstoke, 1976) 72-75.
Index Terms
Keywords