A Project on Cyclic Ordering of Some Families of Graphs
Cedric Xia, Joseph Zhang, Allan Zhou

TL;DR
This paper investigates cyclic base orderings in various classes of graphs, aiming to understand how edges can be cyclically arranged so that consecutive edges form spanning trees.
Contribution
It introduces new results on cyclic base orderings for triangular grid graphs, series compositions, generalized theta graphs, and circulant graphs.
Findings
Established cyclic base orderings for triangular grid graphs
Analyzed cyclic orderings in series compositions of graphs
Extended cyclic ordering concepts to generalized theta and circulant graphs
Abstract
Let be an -vertex connected graph. A cyclic base ordering of is a cyclic ordering of all edges such that every cyclically consecutive edges induce a spanning tree of . In this project, we study cyclic base ordering of triangular grid graphs, series composition of graphs, generalized theta graphs, and circulant graphs.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsGraph theory and applications · Graph Labeling and Dimension Problems · Advanced Graph Theory Research
