Abstract
Abstract There exist well-known distance-regular graphs Γ of diameter 3 for which Γ 3 is a triangle-free graph. An example is given by the Johnson graph J (8, 3) with the intersection array {15, 8, 3;1, 4, 9}. The paper is concerned with the problem of the existence of distance-regular graphs Γ with the intersection arrays {78, 50, 9;1, 15, 60} and {174, 110, 18;1, 30, 132} for which Γ 3 is a triangle-free graph.
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.
