期刊名称：International Journal of Advances in Engineering and Management
电子版ISSN：2395-5252
出版年度：2020
卷号：2
期号：10
页码：139-142
DOI：10.35629/5252-02106366
语种：English
出版社：IJAEM JOURNAL
摘要：Let G be a finite, connected, undirected simple graph with p vertices and q edges. If G1, G2 , . . . , Gn are connected edge – disjoint subgraphs of G with E(G) = E(G1) E(G2) . . . E(Gn), then {G1, G2 , . . . , Gn} is said to be a decomposition of G. In this paper , we introduce a new concept called Continuous Monotonic Cube Decomposition. A graph G is said to have a Continuous Monotonic Cube Decomposition if G can be decomposed into subgraphs { G1, G2, . . . ,Gn} such that each Gi is connected and | E (Gi) | = i3 , for 1 i n . Clearly , q = 2 2 ( 1) n n . Also, we obtained the characterization for a coconut tree graph CTm to admit Continuous Monotonic Cube Decomposition.
关键词：Decomposition of graph;Continuous Monotonic Decomposition;Continuous Monotonic Cube Decomposition
