On Resolvable Multipartite G-Designs II

In this paper, it has been proved that (equation omitted) and (equation omitted) are (equation omitted) factorable, where (symbol omitted) denotes wreath product of graphs. As a consequence, a resolvable (k,n,k,2lamba) multipartite (equation omitted) exists for even k. These results generalize the r...

Full description

Saved in:
Bibliographic Details
Published in:Graphs and combinatorics 2006-04, Vol.22 (1), p.59-67
Main Authors: Karunambigai, M G, Muthusamy, A
Format: Article
Language:English
Subjects:
Graphs
Mathematical analysis
Citations: Items that this one cites
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:In this paper, it has been proved that (equation omitted) and (equation omitted) are (equation omitted) factorable, where (symbol omitted) denotes wreath product of graphs. As a consequence, a resolvable (k,n,k,2lamba) multipartite (equation omitted) exists for even k. These results generalize the results of Ushio on (equation omitted)-factorizations of complete tripartite graphs. [PUBLICATION ABSTRACT]
ISSN:0911-0119
1435-5914
DOI:10.1007/s00373-006-0644-5