A valency bound for distance-regular graphs
type: Item
instance of: scholarly article
title: A valency bound for distance-regular graphs
zbMATH Open document ID: 1377.05052
author: Zhi Qiao
author: Jack H. Koolen
published in: Journal of Combinatorial Theory. Series A
publication date: 2018-01-12T00:00:00Z
Mathematics Subject Classification ID: 05C12
Mathematics Subject Classification ID: 05C50
Mathematics Subject Classification ID: 05C15
zbMATH DE Number: 6825093
zbMATH Keywords: distance-regular graphs
zbMATH Keywords: 3-chromatic
zbMATH Keywords: valency bound
zbMATH Keywords: smallest eigenvalue
MaRDI profile type: Publication
full work available at URL: j.jcta.2017.11.008
OpenAlex ID: W2768398866
cites work: On 3-chromatic distance-regular graphs
cites work: Q3992965
cites work: The structure of near polygons with quads
cites work: Q5471542
cites work: The nonexistence of regular near octagons with parameters \((s,t,t_2,t_3)=(2,24,0,8)\)
cites work: Q5707657
cites work: There exists no distance-regular graph with intersection array \((5,4,3;1,1,2)\)
cites work: Chromatic number and the 2-rank of a graph
cites work: A Higman-Haemers inequality for thick regular near polygons
cites work: On distance-regular graphs with smallest eigenvalue at least \(- m\)
cites work: Light tails and the Hermitian dual polar graphs
cites work: Strongly regular graphs with (-1, 1, 0) adjacency matrix having eigenvalue 3
cites work: Distance-regular graphs
DOI: 10.1016/J.JCTA.2017.11.008
description: scientific article; zbMATH DE number 6825093