Now showing items 1-4 of 4
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. |
URI: | http://dyuthi.cusat.ac.in/purl/2859 |
Files | Size |
---|---|
Dyuthi-P00402.pdf | (168.7Kb) |
Abstract: | In this paper, two notions, the clique irreducibility and clique vertex irreducibility are discussed. A graph 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 it is clique vertex irreducible if every clique in G has a vertex which does not lie in any other clique of G. It is proved that L(G) is clique irreducible if and only if every triangle in G has a vertex of degree two. The conditions for the iterations of line graph, the Gallai graphs, the anti-Gallai graphs and its iterations to be clique irreducible and clique vertex irreducible are also obtained. |
URI: | http://dyuthi.cusat.ac.in/purl/615 |
Files | Size |
---|---|
vijaya kumar maths.pdf | (231.6Kb) |
Abstract: | In this paper, we study the domination number, the global dom ination number, the cographic domination number, the global co graphic domination number and the independent domination number of all the graph products which are non-complete extended p-sums (NEPS) of two graphs. |
URI: | http://dyuthi.cusat.ac.in/purl/641 |
Files | Size |
---|---|
A_note_on_some_domination.pdf | (133.4Kb) |
Abstract: | In this note,the (t) properties of five class are studied. We proved that the classes of cographs and clique perfect graphs without isolated vertices satisfy the (2) property and the (3) property, but do not satisfy the (t) property for tis greater than equal to 4. The (t) properties of the planar graphs and the perfect graphss are also studied . we obtain a necessary and suffieient conditions for the trestled graph of index K to satisfy the (2) property |
URI: | http://dyuthi.cusat.ac.in/purl/1533 |
Files | Size |
---|---|
The (t) property of some classes of graphs.PDF | (3.911Mb) |
Now showing items 1-4 of 4
Dyuthi Digital Repository Copyright © 2007-2011 Cochin University of Science and Technology. Items in Dyuthi are protected by copyright, with all rights reserved, unless otherwise indicated.