Distance-regular graphs and halved graphs
From MaRDI portal
Publication:1084410
DOI10.1016/S0195-6698(86)80037-3zbMath0606.05041MaRDI QIDQ1084410
Publication date: 1986
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Paths and cycles (05C38) Structural characterization of families of graphs (05C75) Graph theory (05C99)
Related Items
Distance-regular graphs of large diameter that are completely regular clique graphs, Antipodal covers of distance-transitive generalized polygons, Recognizing halved cubes in a constant time per edge, Finite primitive distance-transitive graphs, The large cliques in the graph of quadratic forms, Bipartite distance-transitive doubles with primitive halved of diameter two, Antipodal distance-transitive covers with primitive quotient of diameter two, The last subconstituent of the Hemmeter graph, A new family of distance-regular graphs and the \(\{ 0,1,2 \}\)-cliques in dual polar graphs, On small world non-Sunada twins and cellular Voronoi diagrams, \((s,r;\mu )\)-nets and alternating forms graphs, Smith's theorem and a characterization of the 6-cube as distance-transitive graph, Imprimitive distance-transitive graphs with primitive core of diameter at least 3, Linear groups and distance-transitive graphs, Current research on algebraic combinatorics. Supplements to our book, Algebraic combinatorics I, Taut distance-regular graphs of even diameter, Locally s-distance transitive graphs
