Abstract
Let G be a finite, connected, undirected graph without loops or multiple edges. A decomposition {G2, G4, . . . , G2k} of G is said to be an even star decomposition if each Gi is a star and |E(Gi)| = i for all i = 2, 4, . . . , 2k. A graph G is said to have Triple Even Star Decomposition (TESD) if G can be decomposed into 3k stars {3S2, 3S4, . . . , 3S2k}. In this paper, we characterize Triple Even Star Decomposition of complete bipartite graphs
 Km,n when m = 2 and m = 3.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: International Journal on Recent and Innovation Trends in Computing and Communication
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.
