✦ LIBER ✦

Some Properties of Graphs of Diameters

✍ Scribed by Dol'nikov, V. L.

Book ID: 118786305
Publisher: Springer
Year: 2000
Tongue: English
Weight: 52 KB
Volume: 24
Category: Article
ISSN: 0179-5376
DOI: 10.1007/s004540010036

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Some large trivalent graphs having small

Some large trivalent graphs having small diameters

✍ William M. Kantor 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 458 KB

Diameters of cubic graphs

✍ Leif K. Jørgensen 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 440 KB

Diameters of pseudosymmetric graphs

✍ A. V. Knyazev 📂 Article 📅 1987 🏛 SP MAIK Nauka/Interperiodica 🌐 English ⚖ 524 KB

Region distributions of some small diame

Region distributions of some small diameter graphs

✍ Saul Stahl 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 954 KB

Stahl, S., Region distributions of some small diameter graphs, Discrete Mathematics 89 (1991) 281-299. Let G be a graph with a vertex u such that V(G) -{u} induces either a forest or a cycle. It is shown that the region distribution of G is approximately proportional to the Stirling numbers of the f

The Diameters of Some Transition Graphs

The Diameters of Some Transition Graphs Constructed from Hamilton Cycles

✍ Mariko Hagita; Yoshiaki Oda; Katsuhiro Ota 📂 Article 📅 2002 🏛 Springer Japan 🌐 English ⚖ 154 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