ABSTRACT
Let G = (V, E) be a simple connected graph. The induced weak cycle partition of G is defined as the partition of V(G) into subsets such that each subset induces a cycle or K2 or K1. The induced weak cycle number of G, denoted by , is the minimum cardinality taken over all induced weak cycle partitions. In this paper, the concept of induced weak cycle number is introduced and induced weak cycle number of path and some of its derived graphs are studied.
Support the magazine and subscribe to the content
This is premium stuff. Subscribe to read the entire article.
Login if you have purchased
