Induced Graphoidal Decompositions in Product Graphs
Joint Authors
Hamid, I. Sahul
Joseph, Mayamma
Source
Journal of Discrete Mathematics
Issue
Vol. 2013, Issue 2013 (31 Dec. 2013), pp.1-9, 9 p.
Publisher
Hindawi Publishing Corporation
Publication Date
2013-02-20
Country of Publication
Egypt
No. of Pages
9
Main Subjects
Information Technology and Computer Science
Abstract EN
Let G be a nontrivial, simple, finite, connected, and undirected graph.
A graphoidal decomposition (GD) of G is a collection ψ of nontrivial paths and cycles in G that are internally disjoint such that every edge of G lies in exactly one member of ψ.
By restricting the members of a GD ψ to be induced, the concept of induced graphoidal decomposition (IGD) of a graph has been defined.
The minimum cardinality of an IGD of a graph G is called the induced graphoidal decomposition number and is denoted by ηi(G).
An IGD of G without any cycles is called an induced acyclic graphoidal decomposition (IAGD) of G, and the minimum cardinality of an IAGD of G is called the induced acyclic graphoidal decomposition number of G, denoted by ηia(G).
In this paper we determine the value of ηi(G) and ηia(G) when G is a product graph, the factors being paths/cycles.
American Psychological Association (APA)
Joseph, Mayamma& Hamid, I. Sahul. 2013. Induced Graphoidal Decompositions in Product Graphs. Journal of Discrete Mathematics،Vol. 2013, no. 2013, pp.1-9.
https://search.emarefa.net/detail/BIM-505962
Modern Language Association (MLA)
Joseph, Mayamma& Hamid, I. Sahul. Induced Graphoidal Decompositions in Product Graphs. Journal of Discrete Mathematics No. 2013 (2013), pp.1-9.
https://search.emarefa.net/detail/BIM-505962
American Medical Association (AMA)
Joseph, Mayamma& Hamid, I. Sahul. Induced Graphoidal Decompositions in Product Graphs. Journal of Discrete Mathematics. 2013. Vol. 2013, no. 2013, pp.1-9.
https://search.emarefa.net/detail/BIM-505962
Data Type
Journal Articles
Language
English
Notes
Includes bibliographical references
Record ID
BIM-505962