✦ LIBER ✦

Convergence of iterated clique graphs

✍ Scribed by Erich Prisner

Publisher: Elsevier Science
Year: 1992
Tongue: English
Weight: 568 KB
Volume: 103
Category: Article
ISSN: 0012-365X
DOI: 10.1016/0012-365x(92)90270-p

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

On iterated clique graphs with increasin

On iterated clique graphs with increasing diameters

✍ C. Peyrat; D. F. Rall; P. J. Slater 📂 Article 📅 1986 🏛 John Wiley and Sons 🌐 English ⚖ 210 KB 👁 1 views

We examine the problem of finding a graph G whose nth iterated clique graph has diameter equal to the diameter of G plus n.

Convergence of sequences of iterated tri

Convergence of sequences of iterated triangular line graphs

✍ David Dorrough 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 333 KB

The triangular line graph T(G) of a graph G is the graph with vertex set E(G), with two distinct vertices e and f of T(G) adjacent if and only if the edges e and f belong to a common copy ofK 3 in G. For n/> 1, the nth iterated triangular line graph T"(G) of a graph G is defined as T(T n-I(G)), wher

Convergent sequences of iterated H-line

Convergent sequences of iterated H-line graphs

✍ Gary Chartrand; Heather Gavlas; Michelle Schultz 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 629 KB

For a connected graph H of order at least 3, the H-line graph HL(G) of a graph G is defined as that graph whose vertices are the edges of G and where two vertices of HL(G) are adjacent if and only if the corresponding edges of G are adjacent and belong to a common copy of H. For k >~ 2, the kth ite

Clique graphs of packed graphs

✍ Iwao Sato 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 129 KB

Let IGI be the number of vertices of a graph G and to(G) be the density of G. We call a graph G packed if the clique graph K(G) of G has exactly 2 IGI-O'(G) cliques. We correct the characterization of clique graphs of packed graphs given in Theorem 3.2 of Hedman [3]. All graphs considered here are f