Clique Irreducibility and Clique Vertex Irreducibility of Graphs

Dyuthi/Manakin Repository

Clique Irreducibility and Clique Vertex Irreducibility of Graphs

Show simple item record

dc.contributor.author Aparna, Lakshmanan S
dc.contributor.author Vijayakumar, A.
dc.date.accessioned 2012-04-11T08:39:12Z
dc.date.available 2012-04-11T08:39:12Z
dc.date.issued 2009
dc.identifier.issn 1452-8630
dc.identifier.other Applicable Analysis and Discrete Mathematics,3 (2009), 137–146.
dc.identifier.uri http://dyuthi.cusat.ac.in/purl/2859
dc.description.abstract A graphs G is clique irreducible if every clique in G of size at least two,has an edge which does not lie in any other clique of G and is clique reducible if it is not clique irreducible. A graph G is clique vertex irreducible if every clique in G has a vertex which does not lie in any other clique of G and clique vertex reducible if it is not clique vertex irreducible. The clique vertex irreducibility and clique irreducibility of graphs which are non-complete extended p-sums (NEPS) of two graphs are studied. We prove that if G(c) has at least two non-trivial components then G is clique vertex reducible and if it has at least three non-trivial components then G is clique reducible. The cographs and the distance hereditary graphs which are clique vertex irreducible and clique irreducible are also recursively characterized. en_US
dc.language.iso en en_US
dc.subject Clique vertex irreducible graphs en_US
dc.subject Clique irreducible graphs en_US
dc.subject Non-complete extended p-sum (NEPS) en_US
dc.subject Cographs en_US
dc.subject Distance hereditary graphs en_US
dc.title Clique Irreducibility and Clique Vertex Irreducibility of Graphs en_US
dc.type Working Paper en_US


Files in this item

Files Size Format View Description
Dyuthi-P00402.pdf 164.8Kb PDF View/Open PDF

This item appears in the following Collection(s)

Show simple item record

Search Dyuthi


Advanced Search

Browse

My Account