𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Classification of a class of distance-regular graphs via completely regular codes

✍ Scribed by Josep Rifà; L. Huguet

Publisher
Elsevier Science
Year
1990
Tongue
English
Weight
699 KB
Volume
26
Category
Article
ISSN
0166-218X

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Dual distances of completely regular cod
Dual distances of completely regular codes
✍ B. Courteau; A. Montpetit 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 467 KB

Courteau, B. and A. Montpetit, Dual distances of completely regular codes, Discrete Mathematics 89 (1991) 7-15. In this paper we prove two theorems giving arithmetical constraints on the possible values of dual distances of completely regular codes extending some recent results of Calderbank and Gce

A class of Hamiltonian regular graphs
A class of Hamiltonian regular graphs
✍ Paul Erdös; Arthur M. Hobbs 📂 Article 📅 1978 🏛 John Wiley and Sons 🌐 English ⚖ 317 KB

## Abstract In this paper, we show that __n__ ⩾ 4 and if __G__ is a 2‐connected graph with 2__n__ or 2__n__−1 vertices which is regular of degree __n__−2, then __G__ is Hamiltonian if and only if __G__ is not the Petersen graph.