Decomposition of graphs into induced paths and cycles
- Title
- Decomposition of graphs into induced paths and cycles
- Creator
- Sahul Hamid I.; Abraham V.M.
- Description
- 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.
- Source
- International Journal of Computational and Mathematical Sciences, Vol-3, No. 7, pp. 311-315.
- Date
- 2009-01-01
- Subject
- Induced path decomposition; Induced path decomposition number; Path decomposition
- Coverage
- Sahul Hamid I., Department of Mathematics, The Madura College, Madurai-11, India; Abraham V.M., Department of Mathematics, Christ University, Bangalore, India
- Rights
- Restricted Access
- Relation
- ISSN: 20103913
- Format
- Online
- Language
- English
- Type
- Article
Collection
Citation
Sahul Hamid I.; Abraham V.M., “Decomposition of graphs into induced paths and cycles,” CHRIST (Deemed To Be University) Institutional Repository, accessed February 25, 2025, https://archives.christuniversity.in/items/show/17340.