Abstract
A kite K is a graph which can be obtained by joining an edge to any vertex of K 3 . A kite with edge set { a b , b c , c a , c d } can be denoted as ( a , b , c ; c d ) . If every vertex of a kite in the decomposition lies in different partite sets, then we say that a kite decomposition of a multipartite graph is a gregarious kite decomposition. In this manuscript, it is shown that there exists a decomposition of ( K m ⊗ ¯¯¯¯¯ K n ) × ( K r ⊗ ¯¯¯¯¯ K s ) into gregarious kites if and only if n 2 s 2 m ( m − 1 ) r ( r − 1 ) ≡ 0 ( mod 8 ) , where ⊗ and × denote the wreath product and tensor product of graphs respectively. We denote a gregarious kite decomposition as G K -decomposition.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
More From: Journal of Combinatorial Mathematics and Combinatorial Computing
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.