A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf
.
Uniform coverings of 2-paths with 4-cycles
2015
AKCE International Journal of Graphs and Combinatorics
Let G be a graph [a digraph] and H be a subgraph of G. A D(G, H, λ) design is a multiset D of subgraphs of G each isomorphic to H so that every 2-path [directed 2-path] of G lies in exactly λ subgraphs in D. In this paper, we show that there exists a D(K n,n , C 4 , λ) design if and only if (i) n is even, or (ii) n is odd and λ is even. We also show that there exists a D(K * n,n , − → C 4 , λ) design for every n and λ, where K n,n and K * n,n are the complete bipartite graph and the complete
doi:10.1016/j.akcej.2015.06.011
fatcat:hzbfv2c5ofg2ffkpgdk7s6yyb4