Abstract
Let be a distance regular graph with intersection array b 0, b 1,..., b d–1; c 1,..., c d. It is shown that in some cases (c i–1, a i–1, b i–1) = (c 1, a 1, b 1)and (c 2i–1, a 2i–1, b 2i–1) imply k 2b i + 1. As a corollary all distance regular graphs of diameter d = 3i – 1 with b i = 1 and k > 2 are determined.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
