From regular boundary graphs to antipoda
✍
Fiol, M. A.; Garriga, E.; Yebra, J. L. A.
📂
Article
📅
1998
🏛
John Wiley and Sons
🌐
English
⚖ 383 KB
👁 2 views
Let Γ be a regular graph with n vertices, diameter D, and d + 1 In a previous paper, the authors showed that if P (λ) > n -1, then D ≤ d -1, where P is the polynomial of degree d-1 which takes alternating values ±1 at λ 1 , . . . , λ d . The graphs satisfying P (λ) = n -1, called boundary graphs, h