A relationship between the diameter and the intersection number c (2) for a distance-regular graph
SCIE
SCOPUS
- Title
- A relationship between the diameter and the intersection number c (2) for a distance-regular graph
- Authors
- Koolen, JH; Park, J
- Date Issued
- 2012-10
- Publisher
- SPRINGER
- Abstract
- In this paper we will look at the relationship between the intersection number c (2) and the diameter of a distance-regular graph. We also give some tools to show that a distance-regular graph with large c (2) is bipartite, and a tool to show that if k (D) is too small then the distance-regular graph has to be antipodal.
- Keywords
- Distance-regular graphs; Intersection numbers; Hadamard graphs; Hypercubes; Diameter
- URI
- https://oasis.postech.ac.kr/handle/2014.oak/15708
- DOI
- 10.1007/S10623-011-9600-3
- ISSN
- 0925-1022
- Article Type
- Article
- Citation
- DESIGNS CODES AND CRYPTOGRAPHY, vol. 65, no. 1-2, page. 55 - 63, 2012-10
- Files in This Item:
- There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.