| dc.contributor.author |
Aparna,Lakshmanan S |
|
| dc.contributor.author |
Vijayakumar,A |
|
| dc.date.accessioned |
2008-08-06T10:25:12Z |
|
| dc.date.available |
2008-08-06T10:25:12Z |
|
| dc.date.issued |
2008 |
|
| dc.identifier.uri |
http://dyuthi.cusat.ac.in/purl/615 |
|
| dc.description.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. |
en_US |
| dc.language.iso |
en |
en_US |
| dc.publisher |
Department of Mathematics |
en_US |
| dc.subject |
line graphs |
en_US |
| dc.subject |
anti-Gallai graphs |
en_US |
| dc.subject |
Gallai graphs |
en_US |
| dc.subject |
clique irre-ducible graphs |
en_US |
| dc.subject |
clique vertex irreducible graphs |
en_US |
| dc.title |
Clique Irreducibility of Some Iterative Classes of Graphs |
en_US |
| dc.type |
Working Paper |
en_US |