TY - JFULL
AU - Abraham V. M. and I. Sahul Hamid
PY - 2010/2/
TI - Induced Acyclic Path Decomposition in Graphs
T2 - International Journal of Mathematical and Computational Sciences
SP - 108
EP - 112
VL - 4
SN - 1307-6892
UR - https://publications.waset.org/pdf/13
PU - World Academy of Science, Engineering and Technology
NX - Open Science Index 37, 2010
N2 - A decomposition of a graph G is a collection ψ of
graphs H1,H2, . . . , Hr of G such that every edge of G belongs
to exactly one Hi. If each Hi is either an induced path in G,
then ψ is called an induced acyclic path decomposition of G and
if each Hi is a (induced) cycle in G then ψ is called a (induced)
cycle decomposition of G. The minimum cardinality of an induced
acyclic path decomposition of G is called the induced acyclic path
decomposition number of G and is denoted by ¤Çia(G). Similarly
the cyclic decomposition number ¤Çc(G) is defined. In this paper we
begin an investigation of these parameters.
ER -