✦ LIBER ✦

The difference between clique graphs and iterated clique graphs

✍ Scribed by Pablo De Caria

Book ID: 108120799
Publisher: Elsevier Science
Year: 2011
Tongue: English
Weight: 280 KB
Volume: 37
Category: Article
ISSN: 1571-0653
DOI: 10.1016/j.endm.2011.05.008

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Dismantlings and iterated clique graphs

✍ M.E Frı́as-Armenta; V Neumann-Lara; M.A Pizaña 📂 Article 📅 2004 🏛 Elsevier Science 🌐 English ⚖ 190 KB

Clique Graphs and Edge-clique graphs

✍ Márcia R. Cerioli 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 84 KB

Convergence of iterated clique graphs

✍ Erich Prisner 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 568 KB

Diameters of iterated clique graphs of c

Diameters of iterated clique graphs of chordal graphs

✍ Bor-Liang Chen; Ko-Wei Lih 📂 Article 📅 1990 🏛 John Wiley and Sons 🌐 English ⚖ 272 KB

## Abstract The clique graph __K__(__G__) of a graph is the intersection graph of maximal cliques of __G.__ The iterated clique graph __K__^__n__^(__G__) is inductively defined as __K__(K^n−1^(__G__)) and __K__^1^(__G__) = __K__(__G__). Let the diameter diam(__G__) be the greatest distance between

Iterated clique graphs with increasing d

Iterated clique graphs with increasing diameters

✍ Bornstein, Claudson F.; Szwarcfiter, Jayme L. 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 73 KB

A simple argument by Hedman shows that the diameter of a clique graph G differs by at most one from that of K(G), its clique graph. Hedman described examples of a graph G such that diam(K(G)) = diam(G) + 1 and asked in general about the existence of graphs such that diam(K i (G)) = diam(G) + i. Exam

Distances and diameters on iterated cliq

Distances and diameters on iterated clique graphs

✍ Miguel A. Pizaña 📂 Article 📅 2004 🏛 Elsevier Science 🌐 English ⚖ 203 KB

If G is a graph, its clique graph, K(G), is the intersection graph of all its (maximal) cliques. Iterated clique graphs are then deÿned recursively by: K We study the relationship between distances in G and distances in K n (G). Then we apply these results to Johnson graphs to give a shorter and si