✦ LIBER ✦

An inequality between intersection numbers of a distance-regular graph

✍ Scribed by Kazumasa Nomura

Publisher: Elsevier Science
Year: 1987
Tongue: English
Weight: 82 KB
Volume: 43
Category: Article
ISSN: 0095-8956
DOI: 10.1016/0095-8956(87)90012-8

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Inequalities between the domination numb

Inequalities between the domination number and the chromatic number of a graph

✍ Dieter Gernert 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 230 KB

Upper bounds for u + x and ax are proved, where u is the domination number and x the chromatic number of a graph.

An Application of a Construction Theory

An Application of a Construction Theory of Strongly Closed Subgraphs in a Distance-regular Graph

✍ A. Hiraki 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 112 KB

## Let be a distance-regular graph with where r ≥ 2 and c r +1 > 1. We prove that r = 2 except for the case a 1 = a r +1 = 0 and c r +1 = 2 by showing the existence of strongly closed subgraphs.