Some gregarious kite decompositions of complete equipartite graphs

2Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.

Abstract

A kite decomposition of a complete multipartite graph is said to be gregarious if each kite in the decomposition has its vertices in four different partite sets. In this paper,we give certain necessary and sufficient conditions for the existence of a gregarious kite decomposition of the complete equipartite graph Kn(m) (with n ≥ 4 parts of size m). © 2012 Elsevier B.V. All rights reserved.

Cite

CITATION STYLE

APA

Fu, C. M., Hsu, Y. F., Lo, S. W., & Huang, W. C. (2013). Some gregarious kite decompositions of complete equipartite graphs. Discrete Mathematics, 313(5), 726–732. https://doi.org/10.1016/j.disc.2012.10.017

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free