40 search results - page 1 / 8 » Distance regularity of compositions of graphs |
APPML
2004
13 years 5 months ago
2004
We study preservation of distance regularity when taking strong sums and strong products of distance-regular graphs. MSC 2000 Classification: 05C12
COMBINATORICS
2000
13 years 5 months ago
2000
A graph with diameter d is strongly distance-regular if is distanceregular and its distance-d graph d is strongly regular. The known examples are all the connected strongly regu...
JCT
2008
13 years 5 months ago
2008
ABSTRACT. In this paper we give a lower bound for the least distortion embedding of a distance regular graph into Euclidean space. We use the lower bound for finding the least dist...
COMBINATORICS
1998
13 years 5 months ago
1998
COMBINATORICS
2002
13 years 5 months ago
2002
Let G = (V, E) be a connected undirected graph and S a subset of vertices. If for all vertices v V , the sets Br(v) S are all nonempty and different, where Br(v) denotes the set...