Title
Distance-regular graphs with b2=1 and antipodal covers
Abstract
We show that a distance-regular graph of valency k > 2 is antipodal, if b(2) = 1. This answers Problem (i) on p. 182 of Brouwer, Cohen and Neumaier [4]. (C) 1997 Academic Press Limited.
Year
DOI
Venue
1997
10.1006/eujc.1996.0097
Eur. J. Comb.
Keywords
Field
DocType
distance-regular graph,distance regular graph
Discrete mathematics,Strongly regular graph,Combinatorics,Line graph,Vertex-transitive graph,Regular graph,Distance-regular graph,Antipodal point,Symmetric graph,Petersen graph,Mathematics
Journal
Volume
Issue
ISSN
18
3
0195-6698
Citations 
PageRank 
References 
1
0.42
0
Authors
3
Name
Order
Citations
PageRank
Makoto Araya1268.52
A. Hiraki27116.18
Aleksandar Jurišić3468.82