On √Q-Distances
✍ Scribed by Hiroshi Maehara
- Publisher
- Elsevier Science
- Year
- 1996
- Tongue
- English
- Weight
- 217 KB
- Volume
- 17
- Category
- Article
- ISSN
- 0195-6698
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
Let 1 denote a bipartite Q-polynomial distance-regular graph with diameter D 4. We show that 1 is the quotient of an antipodal distance-regular graph if and only if one of the following holds. (i) 1 is a cycle of even length. (ii) 1 is the quotient of the 2D-cube. 1999 Academic Press \* , ..., %\
We show that a graph G with n vertices is a q-tree if and only if its chromatic polynomial is P(G,A) = A(A -I)...(A -q + l ) ( As ) " -~ where n L q. The graphs which we consider here are finite, undirected, simple, and loopless. Let q be an integer L 1. The graphs called q-trees are defined by re
Let n k denote the number of times the kth largest distance occurs among a set S of n points in the Euclidean plane. We prove that n2 ~< 2~n for arbitrary set S. This upper bound is sharp. We consider the set S of n arbitrary points in R 2. We denote the largest distance between two points in S by
and Terwilliger recently introduced the notion of a tridiagonal pair. We apply their results to distance-regular graphs and obtain the following theorem. THEOREM. Let denote a distance-regular graph with diameter D ≥ 3. Suppose is Q-polynomial with respect to the ordering E 0 , E 1 , . . . , E D of