Abstract
Small k -regular graphs of girth g where g = 6 , 8 , 12 are obtained as subgraphs of minimal cages. More precisely, we obtain ( k , 6 ) -graphs on 2 ( k q − 1 ) vertices, ( k , 8 ) -graphs on 2 k ( q 2 − 1 ) vertices and ( k , 12 ) -graphs on 2 k q 2 ( q 2 − 1 ) , where q is a prime power and k is a positive integer such that q ≥ k ≥ 3 . Some of these graphs have the smallest number of vertices known so far among the regular graphs with girth g = 6 , 8 , 12 .
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.
