Name
Abstract | ||
|---|---|---|
Let S-g be the orientable surface of genus g for a fixed non-negative integer g. We show that the number of vertex-labelled cubic multigraphs embeddable on S-g with 2n vertices is asymptotically C(g)n(5/2( g -1)-1)gamma(2n)(2n)!, where gamma is an algebraic constant and C-g is a constant depending only on the genus g. We also derive an analogous result for simple cubic graphs and weighted cubic multigraphs. Additionally, for g >= 1, we prove that a typical cubic multigraph embeddable on S-g has exactly one non-planar component. |
Year | Venue | Keywords |
|---|---|---|
2018 | ELECTRONIC JOURNAL OF COMBINATORICS | Cubic graphs,graphs on surfaces,triangulations,asymptotic enumeration,analytic combinatorics |
Field | DocType | Volume |
Graph,Discrete mathematics,Combinatorics,Multigraph,Algebraic number,Vertex (geometry),Cubic graph,Cubic crystal system,Mathematics | Journal | 25 |
Issue | ISSN | Citations |
1.0 | 1077-8926 | 0 |
PageRank | References | Authors |
0.34 | 10 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Wenjie Fang | 1 | 28 | 7.68 |
| Mihyun Kang | 2 | 163 | 29.18 |
| Michael Moßhammer | 3 | 0 | 0.34 |
| Philipp Sprüssel | 4 | 46 | 8.52 |