✦ LIBER ✦

On perturbations of almost distance-regular graphs

✍ Scribed by C. Dalfó; E.R. van Dam; M.A. Fiol

Publisher: Elsevier Science
Year: 2011
Tongue: English
Weight: 507 KB
Volume: 435
Category: Article
ISSN: 0024-3795
DOI: 10.1016/j.laa.2011.05.004

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Almost 2-homogeneous Bipartite Distance-

Almost 2-homogeneous Bipartite Distance-regular Graphs

✍ Brian Curtin 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 170 KB

Remarks on distance-regular graphs

✍ Mitsuo Yoshizawa 📂 Article 📅 1981 🏛 Elsevier Science 🌐 English ⚖ 157 KB

Regular subgraphs of almost regular grap

Regular subgraphs of almost regular graphs

✍ N Alon; S Friedland; G Kalai 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 628 KB

On automorphisms of distance-regular gra

On automorphisms of distance-regular graphs

✍ A. A. Makhnev 📂 Article 📅 2010 🏛 Springer US 🌐 English ⚖ 173 KB

A Note on Almost Regular Graphs

✍ M. Of Hofmeister Munich 📂 Article 📅 1994 🏛 John Wiley and Sons 🌐 English ⚖ 136 KB

It can easily be seen that a conjecture of RUNGE does not hold for a class of graphs whose members will be called "almost regular". This conjecture is replaced by a weaker one, and a classification of almost regular graphs is given.

Almost-regular factorization of graphs

✍ Jin Akiyama; Mikio Kano 📂 Article 📅 1985 🏛 John Wiley and Sons 🌐 English ⚖ 238 KB

For integers a and b, 0 s a s b, an [a,bl-graph G satisfies a s deg(x,G) s b for every vertex x of G, and an [a.bl-factor is a spanning subgraph its edges can be decomposed into [a,bl-factors. When both k and tare positive integers and s is a nonnegative integer, w e prove that every [(12k + 2)t +