Abstract
A pentagraph is a simple graph without cycles on 3 or 4 vertices and without induced cycles of odd length at least 7. In this paper, we present some structural properties of pentagraphs. As a corollary, we give a short proof that there is exactly one 3-connected internally 4-connected non-bipartite cubic pentagraph, which is the Petersen 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.
