TY - JFULL AU - I. Sahul Hamid and Abraham V. M. PY - 2009/12/ TI - Decomposition of Graphs into Induced Paths and Cycles T2 - International Journal of Mathematical and Computational Sciences SP - 938 EP - 943 VL - 3 SN - 1307-6892 UR - https://publications.waset.org/pdf/3065 PU - World Academy of Science, Engineering and Technology NX - Open Science Index 35, 2009 N2 - A decomposition of a graph G is a collection ψ of subgraphs H1,H2, . . . , Hr of G such that every edge of G belongs to exactly one Hi. If each Hi is either an induced path or an induced cycle in G, then ψ is called an induced path decomposition of G. The minimum cardinality of an induced path decomposition of G is called the induced path decomposition number of G and is denoted by πi(G). In this paper we initiate a study of this parameter. ER -