Year-end Sale % OFF 
Abstract
Let Λ be a distance-regular graph with diameter at least three and height h=2, where h=max{i : p ≠0}. Suppose that for every α in Λ and β in Λ d (α), the induced subgraph on Λ d (α) ∩ (β) Λ2 is a clique. Then Λ is isomorphic to the Johnson graph J (8, 3).
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.
