𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On iterated clique graphs with increasing diameters

✍ Scribed by C. Peyrat; D. F. Rall; P. J. Slater

Publisher
John Wiley and Sons
Year
1986
Tongue
English
Weight
210 KB
Volume
10
Category
Article
ISSN
0364-9024

No coin nor oath required. For personal study only.

✦ Synopsis

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

πŸ“œ SIMILAR VOLUMES

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

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

On connectivity in graphs with given cli
On connectivity in graphs with given clique number
✍ Angelika Hellwig; Lutz Volkmann πŸ“‚ Article πŸ“… 2006 πŸ› John Wiley and Sons 🌐 English βš– 82 KB πŸ‘ 1 views

## Abstract We consider finite, undirected, and simple graphs __G__ of order __n__(__G__) and minimum degree Ξ΄(__G__). The connectivity ΞΊ(__G__) for a connected graph __G__ is defined as the minimum cardinality over all vertex‐cuts. If ΞΊ(__G__) < δ(__G__), then Topp and Volkmann 7 showed in 1993 f

On vertex critical graphs with prescribe
On vertex critical graphs with prescribed diameter
✍ L. Caccetta; S. EL-Batanouny; J. Huang πŸ“‚ Article πŸ“… 2003 πŸ› John Wiley and Sons 🌐 English βš– 167 KB πŸ‘ 1 views

## Abstract Let __G__ be connected simple graph with diameter __d__(__G__). __G__ is said __v__^+^‐critical if __d__(__G__βˆ’__v__) is greater than __d__(__G__) for every vertex __v__ of __G__. Let Dβ€² = max {__d__(__G__βˆ’__v__) : __v__ ∈ __V__(__G__)}. Boals et al. [Congressus Numerantium 72 (1990), 1

On local connectivity of graphs with giv
On local connectivity of graphs with given clique number
✍ Andreas Holtkamp; Lutz Volkmann πŸ“‚ Article πŸ“… 2009 πŸ› John Wiley and Sons 🌐 English βš– 72 KB

## Abstract For a vertex __v__ of a graph __G__, we denote by __d__(__v__) the __degree__ of __v__. The __local connectivity__ ΞΊ(__u, v__) of two vertices __u__ and __v__ in a graph __G__ is the maximum number of internally disjoint __u__ –__v__ paths in __G__, and the __connectivity__ of __G__ is