A relationship between the diameter and the intersection number c 2 for a distance-regular graph

Jack H. Koolen; Jongyook Park

doi:10.1007/s10623-011-9600-3

A relationship between the diameter and the intersection number c ₂ for a distance-regular graph

Jack H. Koolen
, Jongyook Park

Pohang University of Science and Technology

Research output: Contribution to journal › Article › peer-review

7 Scopus citations

Abstract

In this paper we will look at the relationship between the intersection number c ₂ and the diameter of a distance-regular graph. We also give some tools to show that a distance-regular graph with large c ₂ is bipartite, and a tool to show that if k _D is too small then the distance-regular graph has to be antipodal.

Original language	English
Pages (from-to)	55-63
Number of pages	9
Journal	Designs, Codes, and Cryptography
Volume	65
Issue number	1-2
DOIs	https://doi.org/10.1007/s10623-011-9600-3
State	Published - Oct 2012

Keywords

Diameter
Distance-regular graphs
Hadamard graphs
Hypercubes
Intersection numbers

Access to Document

10.1007/s10623-011-9600-3

Cite this

@article{d18e623a54544d93978808b28957013e,

title = "A relationship between the diameter and the intersection number c 2 for a distance-regular graph",

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 = "Diameter, Distance-regular graphs, Hadamard graphs, Hypercubes, Intersection numbers",

author = "Koolen, \{Jack H.\} and Jongyook Park",

year = "2012",

month = oct,

doi = "10.1007/s10623-011-9600-3",

language = "English",

volume = "65",

pages = "55--63",

journal = "Designs, Codes, and Cryptography",

issn = "0925-1022",

publisher = "Springer Netherlands",

number = "1-2",

}

TY - JOUR

T1 - A relationship between the diameter and the intersection number c 2 for a distance-regular graph

AU - Koolen, Jack H.

AU - Park, Jongyook

PY - 2012/10

Y1 - 2012/10

N2 - 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.

AB - 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.

KW - Diameter

KW - Distance-regular graphs

KW - Hadamard graphs

KW - Hypercubes

KW - Intersection numbers

UR - https://www.scopus.com/pages/publications/84863187904

U2 - 10.1007/s10623-011-9600-3

DO - 10.1007/s10623-011-9600-3

M3 - Article

AN - SCOPUS:84863187904

SN - 0925-1022

VL - 65

SP - 55

EP - 63

JO - Designs, Codes, and Cryptography

JF - Designs, Codes, and Cryptography

IS - 1-2

ER -

A relationship between the diameter and the intersection number c ₂ for a distance-regular graph

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this