Back to Search Start Over

Strongly Closed Subgraphs in a Distance-Regular Graph with c 2 > 1.

Authors :
Hiraki, Akira
Source :
Graphs & Combinatorics. Dec2008, Vol. 24 Issue 6, p537-550. 14p.
Publication Year :
2008

Abstract

Let Γ be a distance-regular graph of diameter d ≥ 3 with c 2 > 1. Let m be an integer with 1 ≤ m ≤ d − 1. We consider the following conditions: Suppose that the condition ( SC) m holds. Then it has been known that the condition ( BB) i holds for all i with 1 ≤ i ≤ m. Similarly we can show that the condition ( CA) i holds for all i with 1 ≤ i ≤ m. In this paper we prove that if the conditions ( BB) i and ( CA) i hold for all i with 1 ≤ i ≤ m, then the condition ( SC) m holds. Applying this result we give a sufficient condition for the existence of a dual polar graph as a strongly closed subgraph in Γ. [ABSTRACT FROM AUTHOR]

Details

Language :
English
ISSN :
09110119
Volume :
24
Issue :
6
Database :
Academic Search Index
Journal :
Graphs & Combinatorics
Publication Type :
Academic Journal
Accession number :
35500391
Full Text :
https://doi.org/10.1007/s00373-008-0814-8