Triple Even Star Decomposition of Complete Bipartite Graphs
Main Article Content
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.
Article Details
How to Cite
E. Esakkiammal, et al. (2023). Triple Even Star Decomposition of Complete Bipartite Graphs. International Journal on Recent and Innovation Trends in Computing and Communication, 11(11), 479–483. https://doi.org/10.17762/ijritcc.v11i11.9917
Issue
Section
Articles