The average genus for bouquets of circles and dipoles
Jinlian Zhang, Xuhui Peng, Yichao Chen

TL;DR
This paper derives explicit formulas for the average genus of bouquets of circles and dipole graphs, revealing asymptotic behavior and introducing a novel method based on differential equations.
Contribution
It provides the first explicit formulas for the average genus of these graph classes using a new approach involving ordinary differential equations.
Findings
Average genus of $B_n$ approximates to (n - ln n - c + 1 - ln 2)/2
Similar formulas obtained for $D_n$
Method introduces a novel differential equations approach
Abstract
The bouquet of circles and dipole graph are two important classes of graphs in topological graph theory. For , we give an explicit formula for the average genus of . By this expression, one easily sees , where is the Euler constant. Similar results are obtained for . Our method is new and deeply depends on the knowledge in ordinary differential equations.
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
TopicsAdvanced Graph Theory Research · Geometric and Algebraic Topology · Homotopy and Cohomology in Algebraic Topology
