Isomorphic factorisations III: Complete multipartite graphs

1978 ◽  
pp. 47-54 ◽  
Author(s):  
Frank Harary ◽  
Robert W. Robinson ◽  
Nicholas C. Wormald
Keyword(s):  
Multipartite Graphs ◽  
Complete Multipartite Graphs ◽  
Complete Multipartite

scholarly journals On DRC-covering of K(n) t λ by cycles

2009 ◽  
Vol 6 (2) ◽  
pp. 229-237 ◽  
Author(s):  
Zhihe Liang
Keyword(s):  
Lower Bound ◽  
Wdm Networks ◽  
Optimal Solutions ◽  
Multipartite Graphs ◽  
Complete Multipartite Graphs ◽  
Number Of Cycles ◽  
Complete Multipartite

This paper considers the cycle covering of complete multipartite graphs motivated by the design of survivable WDM networks, where the requests are routed on sub-networks which are protected independently from each other. The problem can be stated as follows: for a given graph G, find a cycle covering of the edge set of K (n) t ? , where V( Kt (n))=V(G), such that each cycle in the covering satisfies the disjoint routing constraint (DRC). Here we consider the case where G=Ctn, a ring of size tn and we want to minimize the number of cycles ? (nt, ?) in the covering. For the problem, we give the lower bound of ? (nt, ?), and obtain the optimal solutions when n is even or n is odd and both ? and t are even.

Sign in / Sign up

Export Citation Format

Share Document