𝔖 Bobbio Scriptorium
✦   LIBER   ✦

ON A CONJECTURE ON n TH ORDER DEGREE REGULAR GRAPHS

✍ Scribed by Henning, Michael A.; Swart, Henda C.

Book ID
118183176
Publisher
Taylor and Francis Group
Year
1994
Tongue
English
Weight
460 KB
Volume
17
Category
Article
ISSN
1607-3606

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

A remark on Mulder's conjecture about in
A remark on Mulder's conjecture about interval-regular graphs
✍ K. Nomura πŸ“‚ Article πŸ“… 1995 πŸ› Elsevier Science 🌐 English βš– 184 KB

Let F be a connected graph. F is said to be interval-regular if I F~\_ l(u) uF(x )J =. i holds for all vertices u and x ~ Fi(u), i > 0. For u, v e F, let I (u, v) denote the set of all vertices on a shortest path connecting u, v. A subset W of V(F) is said to be convex if l(u,v) c W holds for each u

On Kotzig's conjecture for graphs with a
On Kotzig's conjecture for graphs with a regular path-connectedness
✍ Keyi Xing; Baosheng H.U πŸ“‚ Article πŸ“… 1994 πŸ› Elsevier Science 🌐 English βš– 397 KB

Kotzig (see Bondy and Murty (1976)) conjectured that there exists no graph with the property that every pair of vertices is connected by a unique path of length k, k>2. Here we prove this conjecture for k> 12.

On (I*.n)-regular graphs
On (I*.n)-regular graphs
✍ Henning, H. A.; Swart, Henda C.; Winter, P. A. πŸ“‚ Article πŸ“… 1988 πŸ› Taylor and Francis Group 🌐 English βš– 329 KB
On a Conjecture of Bannai and Ito: There
On a Conjecture of Bannai and Ito: There are Finitely Many Distance-regular Graphs with Degree 5, 6 or 7
✍ J.H. Koolen; V. Moulton πŸ“‚ Article πŸ“… 2002 πŸ› Elsevier Science 🌐 English βš– 312 KB

Bannai and Ito conjectured in a 1987 paper that there are finitely many distance-regular graphs with fixed degree that is greater than two. In a series of papers they showed that their conjecture held for distance-regular graphs with degrees 3 or 4. In this paper we prove that the Bannai-Ito conject