✦ LIBER ✦

On Kotzig's conjecture for graphs with a regular path-connectedness

✍ Scribed by Keyi Xing; Baosheng H.U

Publisher: Elsevier Science
Year: 1994
Tongue: English
Weight: 397 KB
Volume: 135
Category: Article
ISSN: 0012-365X
DOI: 10.1016/0012-365x(93)e0106-e

No coin nor oath required. For personal study only.

✦ Synopsis

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.

📜 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 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