On clique convergence of graphs
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 nec...
Sábháilte in:
| Príomhchruthaitheoirí: | , |
|---|---|
| Formáid: | Artigo |
| Teanga: | Inglês |
| Foilsithe / Cruthaithe: |
Taylor & Francis Group
2016-12-01
|
| Sraith: | AKCE International Journal of Graphs and Combinatorics |
| Ábhair: | |
| Rochtain ar líne: | http://www.sciencedirect.com/science/article/pii/S0972860016300160 |
| Clibeanna: |
Níl clibeanna ann, Bí ar an gcéad duine le clib a chur leis an taifead seo!
|