✦ LIBER ✦

Divisible design graphs

✍ Scribed by Willem H. Haemers; Hadi Kharaghani; Maaike A. Meulenberg

Book ID: 108167323
Publisher: Elsevier Science
Year: 2011
Tongue: English
Weight: 213 KB
Volume: 118
Category: Article
ISSN: 0097-3165
DOI: 10.1016/j.jcta.2010.10.003

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Walk-regular divisible design graphs

✍ Dean Crnković, Willem H. Haemers 📂 Article 📅 2013 🏛 Springer 🌐 English ⚖ 186 KB

Design and Performance Analysis of Divis

Design and Performance Analysis of Divisible Load Scheduling Strategies on Arbitrary Graphs

✍ Jingnan Yao; Bharadwaj Veeravalli 📂 Article 📅 2004 🏛 Springer US 🌐 English ⚖ 598 KB

An analogue of group divisible designs f

An analogue of group divisible designs for Moore graphs

✍ R.P Anstee 📂 Article 📅 1981 🏛 Elsevier Science 🌐 English ⚖ 455 KB

Involutive Divisions. Graphs

✍ E. S. Shemyakova 📂 Article 📅 2004 🏛 SP MAIK Nauka/Interperiodica 🌐 English ⚖ 67 KB

On distance-biregular graphs of girth di

On distance-biregular graphs of girth divisible by four

✍ Hiroshi Zuzuki 📂 Article 📅 1994 🏛 Springer Japan 🌐 English ⚖ 163 KB

Graphs with a Cycle of Length Divisible

Graphs with a Cycle of Length Divisible by Three

✍ G.T. Chen; A. Saito 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 468 KB

In this paper, we will prove that every graph \(G\) with minimum degree \(\delta(G) \geqslant 3\) contains a cycle of length divisible by three. This was conjectured to be true by Barefoot, Clark, Douthett, and Entringer. 11994 Academic Press, Inc.