Abstract
A near-polygonal graph is a graph г with a distinguished set C of cycles of common length m such that each path of length two lies in a unique element of C. If m is the girth of г then the graph is called polygonal. We describe various constructions of polygonal and near-polygonal graphs, and some attempts toward their classification.KeywordsTransitive GraphTrivalent GraphSpecial CycleTopological ConstructionAlgebraic Graph TheoryThese keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
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.
