Article ID Journal Published Year Pages File Type
4655573 Journal of Combinatorial Theory, Series A 2012 10 Pages PDF
Abstract

In this paper, we study the distance-regular graphs Γ that have a pair of distinct vertices, say x and y, such that the number of common neighbors of x and y is about half the valency of Γ. We show that if the diameter is at least three, then such a graph, besides a finite number of exceptions, is a Taylor graph, bipartite with diameter three or a line graph.

Related Topics
Physical Sciences and Engineering Mathematics Discrete Mathematics and Combinatorics