Abstract
Two combinatorial methods for constructing a family of symmetric trivalent graphs are presented in this paper. Each family of graphs contains a member for every odd prime numberp. It is proved that in one of the families the girth is unbounded as a function ofp; the other family contains the smallest known trivalent graphs of girth 18 and 19.
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.
