Please use this identifier to cite or link to this item:
https://idr.l2.nitk.ac.in/jspui/handle/123456789/12351Full metadata record
| DC Field | Value | Language |
|---|---|---|
| dc.contributor.author | Hegde, S.M. | - |
| dc.contributor.author | Dara, S. | - |
| dc.date.accessioned | 2020-03-31T08:39:03Z | - |
| dc.date.available | 2020-03-31T08:39:03Z | - |
| dc.date.issued | 2016 | - |
| dc.identifier.citation | AKCE International Journal of Graphs and Combinatorics, 2016, Vol.13, 3, pp.261-266 | en_US |
| dc.identifier.uri | http://idr.nitk.ac.in/jspui/handle/123456789/12351 | - |
| dc.description.abstract | Let G be a graph and KG be the set of all cliques of G, then the clique graph of G denoted by K(G) is the graph with vertex set KG and two elements Qi,Qj?KG form an edge if and only if Qi?Qj?0?. Iterated clique graphs are defined by K0(G)=G, and Kn(G)=K(Kn?1(G)) for n>0. In this paper we prove a necessary and sufficient condition for a clique graph K(G) to be complete when G=G1+G2, give a partial characterization for clique divergence of the join of graphs and prove that if G1, G2 are Clique-Helly graphs different from K1 and G=G1?G2, then K2(G)=G. 2016 Kalasalingam University | en_US |
| dc.title | On clique convergence of graphs | en_US |
| dc.type | Article | en_US |
| Appears in Collections: | 1. Journal Articles | |
Files in This Item:
| File | Description | Size | Format | |
|---|---|---|---|---|
| 16 On clique convergence of graphs.pdf | 198.65 kB | Adobe PDF |  View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.