𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Diameters of cubic graphs

✍ Scribed by Leif K. Jørgensen

Publisher
Elsevier Science
Year
1992
Tongue
English
Weight
440 KB
Volume
37-38
Category
Article
ISSN
0166-218X

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Nonexistence of certain cubic graphs wit
Nonexistence of certain cubic graphs with small diameters
✍ Leif K. Jørgensen 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 560 KB

We consider the maximum number of vertices in a cubic graph with small diameter. We show that a cubic graph of diameter 4 has at most 40 vertices. (The Moore bound is 46 and graphs with 38 vertices are known.) We also consider bipartite cubic graphs of diameter 5, for which the Moore bound is 62. We

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 the diameters of commuting graphs
On the diameters of commuting graphs
✍ S. Akbari; A. Mohammadian; H. Radjavi; P. Raja 📂 Article 📅 2006 🏛 Elsevier Science 🌐 English ⚖ 200 KB

The commuting graph of a ring R, denoted by (R), is a graph whose vertices are all non-central elements of R and two distinct vertices x and y are adjacent if and only if xy = yx. Let D be a division ring and n 3. In this paper we investigate the diameters of (M n (D)) and determine the diameters of

Diameters of finite upper half plane gra
Diameters of finite upper half plane graphs
✍ Angel, Jeff; Evans, Ronald 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 370 KB 👁 1 views

Let GF(q) be a finite field of q elements. Let G denote the group of matrices M ( z , y) = (," y ) over GF(q) with y # 0. Fix an irreducible polynomial For each a E G F ( q ) , let X , be the graph whose vertices are the q2 -q elements of G, with two vertices M ( z , y), M ( v , w) joined by an edg

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