Abstract
In this paper we present an upper bound on the degree of a regular graph with girth at least 5 in terms of its second largest eigenvalue (usually denoted by λ2). Next, we consider bipartite r-regular graphs with girth at least 6 whose second largest eigenvalue satisfies λ2⩽r and prove that such graphs are the incidence graphs of two-class partially balanced incomplete block designs and also balanced incomplete block designs. Upper bound on the order of such graphs is also given. We also consider the relations between the incidence graphs of two-class partially balanced incomplete block designs and distance-regular graphs. In particular, we determine all regular reflexive graphs of degree 3 with girth at least 5, all regular graphs with girth at least 5 satisfying λ2⩽3 and all bipartite regular reflexive graphs with girth at least 6.
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.
