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

✍ Scribed by A. Hiraki

• Publisher: Elsevier Science
• Year: 1999
• Tongue: English
• Weight: 112 KB
• Volume: 20
• Category: Article
• ISSN: 0195-6698
• DOI: 10.1006/eujc.1998.0262

✦ Synopsis

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.