✦ LIBER ✦

Clique-gated graphs

✍ Scribed by Johann Hagauer; Sandi Klavẑar

Publisher: Elsevier Science
Year: 1996
Tongue: English
Weight: 345 KB
Volume: 161
Category: Article
ISSN: 0012-365X
DOI: 10.1016/0012-365x(95)00280-a

No coin nor oath required. For personal study only.

✦ Synopsis

Clique-gated graphs form an extension of quasi-median graphs. Two characterizations of these graphs are given and some other structural properties are obtained. An O(nm) algorithm is presented which recognizes clique-gated graphs. Here n and m denote the numbers of vertices and edges of a given graph, respectively.

📜 SIMILAR VOLUMES

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

Clique numbers of graphs

✍ Paul Erdös; Marcel Erné 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 337 KB

For each natural number n, denote by G(n) the set of all numbers c such that there exists a graph with exactly c cliques (i.e., complete subgraphs) and n vertices. We prove the asymptotic estimate Ia(n)l = 0(2"n -z/5) and show that all natural numbers between n + 1 and 2 "-6"5~6 belong to G(n). Thus

Squares, clique graphs, and chordality

✍ W. D. Wallis; Julin Wu 📂 Article 📅 1995 🏛 John Wiley and Sons 🌐 English ⚖ 427 KB

## Abstract We study the squares and the clique graphs of chordal graphs and various special classes of chordal graphs. Chordality conditions for squares and clique graphs are given. Several theorems concering chordal graphs are generalized. © 1996 John Wiley & Sons, Inc.

Convergence of iterated clique graphs

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

Algorithms on clique separable graphs

✍ Fǎnicǎ Gavril 📂 Article 📅 1977 🏛 Elsevier Science 🌐 English ⚖ 925 KB

We define a family of graphs. tailed the clique sepambk graphs. characterized by the fact that they have completely connected rut sets by which we decompose them into r)arts such that when no further decomposition is possible we have a set of simple subgraphs. For example the chordal gmphs and the i

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