Induced acyclic path decomposition in graphs
- Title
- Induced acyclic path decomposition in graphs
- Creator
- Abraham V.M.; Sahul Hamid I.
- Description
- 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.
- Source
- World Academy of Science, Engineering and Technology, Vol-37, pp. 528-531.
- Date
- 2010-01-01
- Subject
- Cycle decomposition; Induced acyclic path decomposition; Induced acyclic path decomposition number
- Coverage
- Abraham V.M., Department of Mathematics, Christ University, Bangalore, India; Sahul Hamid I., Department of Mathematics, The Madura College, Madurai-11, India
- Rights
- Restricted Access
- Relation
- ISSN: 20103778
- Format
- Online
- Language
- English
- Type
- Article
Collection
Citation
Abraham V.M.; Sahul Hamid I., “Induced acyclic path decomposition in graphs,” CHRIST (Deemed To Be University) Institutional Repository, accessed February 25, 2025, https://archives.christuniversity.in/items/show/17329.