Open Access System for Information Sharing

Login Library

 

Article
Cited 9 time in webofscience Cited 9 time in scopus
Metadata Downloads

Delsarte Set Graphs with Small c(2) SCIE SCOPUS

Title
Delsarte Set Graphs with Small c(2)
Authors
Bang, SHiraki, AKoolen, JH
Date Issued
2010-03
Publisher
SPRINGER TOKYO
Abstract
Let Gamma be a Delsarte set graph with an intersection number c(2) (i.e., a distance-regular graph with a set C of Delsarte cliques such that each edge lies in a positive constant number n(C) of Delsarte cliques in C). We showed in Bang et al. (J Combin 28:501-506, 2007) that if psi(1) > 1 then c(2) >= 2 psi(1) where psi(1) := vertical bar Gamma(1)(x)boolean AND C vertical bar for x is an element of V(Gamma) and C aDelsarte clique satisfying d(x, C) = 1. In this paper, we classify Gamma with the case c(2) = 2 psi(1) > 2. As a consequence of this result, we show that if c(2) <= 5 and psi(1) > 1 then Gamma is either a Johnson graph or a folded Johnson graph (J) over bar (4s, 2s) with s >= 3.
Keywords
Delsarte clique; Delsarte set graph; Distance-regular graph; Johnson graph
URI
https://oasis.postech.ac.kr/handle/2014.oak/25572
DOI
10.1007/S00373-010-0905-1
ISSN
0911-0119
Article Type
Article
Citation
GRAPHS AND COMBINATORICS, vol. 26, no. 2, page. 147 - 162, 2010-03
Files in This Item:
There are no files associated with this item.

qr_code

  • mendeley

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.

Related Researcher

Views & Downloads

Browse