Genus distributions for two classes of graphs
The minimum genus (maximum genus) of a graph is defined as the minimum h (maximum h respectively) such that the graph embeds in the sphere with h handles. Duke's interpolation theorem implies that the graph embeds on every surface lying between this minimum and maximum. The authors study how the embeddings of a graph are distributed among these surfaces for two infinite classes of graphs. The first class is the 3-regular closedend ladders, defined as \(P_ n\times K_ 2\) where the edges joining the ends of the paths are duplicated. The second class is the 4- regular cobblestone paths, constructed from \(P_ n\) by duplicating each edge and adding a loop on each end. The authors give formulas for the number of embeddings of these graphs into each surface. These are the first (nontrivial) classes of graphs for which these calculations have be done.
- Hierarchy for imbedding-distribution invariants of a graph
- scientific article; zbMATH DE number 3877215 (Why is no real title available?)
- scientific article; zbMATH DE number 4006288 (Why is no real title available?)
- scientific article; zbMATH DE number 3179262 (Why is no real title available?)
- scientific article; zbMATH DE number 3668616 (Why is no real title available?)
- scientific article; zbMATH DE number 3299758 (Why is no real title available?)
- Map color theorem
- Orientable embedding of Cayley graphs
- SOLUTION OF THE HEAWOOD MAP-COLORING PROBLEM
- Some Results for Discrete Unimodality
- The topological theory of current graphs
- On the embedding genus distribution of ladders and crosses
- Genus distribution of ladder type and cross type graphs
- Permutation-partition pairs. III: Embedding distributions of linear families of graphs
- Cubic graphs whose average number of regions is small
- On the number of maximum genus embeddings of almost all graphs
- Limit points for average genus. II: 2-connected non-simplicial graphs
- Genus distributions for bouquets of circles
- Random Cayley maps for groups generated by involutions
- Overlap matrices and total imbedding distributions
- The genus of a random graph
- Stratified graphs for imbedding systems
- Embedding distributions and Chebyshev polynomials
- Enumerating reflexible 2-cell embeddings of connected graphs
- Partial duality for ribbon graphs. I: distributions
- Genus distributions for several types of ladder-class graphs
- Partial duality for ribbon graphs. II: Partial-twuality polynomials and monodromy computations
- Genus polynomials of ladder-like sequences of graphs
- Limit for the Euler-genus distributions of ladder-like sequences of graphs
- On the average genus of a graph
- Genus polynomials of cycles with double edges
- Orientable embedding genus distribution for certain types of graphs
- The genus distributions of directed antiladders in orientable surfaces
- The genus distributions for a certain type of permutation graphs in orientable surfaces
- The semi-arc automorphism group of a graph with application to map enumeration
- The total embedding distributions of cacti and necklaces
- Genera of Cayley maps
- Total embedding distributions of circular ladders
- Classification of embeddings of closed-end multi-ladders on surfaces
- Genus distribution for two classes of graphs
- Log-concavity of genus distributions for circular ladders
- Genus distributions for iterated claws
- Total embedding distributions of Ringel ladders
- An Introduction to Random Topological Graph Theory
- Genus distribution of \(P_3 \mathop\square P_n\)
- Genus distributions of star-ladders
- Calculating genus polynomials via string operations and matrices
- Log-Concavity of Combinations of Sequences and Applications to Genus Distributions
- Topological Graph Theory: A Personal Account
- The genus distribution of cubic graphs and asymptotic number of rooted cubic maps with high genus
- Counting orientable embeddings by genus for a type of 3-regular graph
- Rates of convergence for the embedding distributions of generalized linear graph families
- Strong log-convexity of genus sequences
- Limit points for average genus. I: 3-connected and 2-connected simplicial graphs
- The genus polynomials of cross-ladder digraphs in orientable surfaces
- Genus distribution of graphs under surgery: adding edges and splitting vertices
- Number of embeddings of circular and Möbius ladders on surfaces
This page was built for publication: Genus distributions for two classes of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1118607)