Overlap matrices and total imbedding distributions
For a given graph \(G\), let \(\alpha_ g(G)\), \(g= 0,1,2,\dots\), denote the number of homeomorphically different 2-cell embeddings of \(G\) in a surface of genus \(g\). The sequence \(\alpha_ g(G)\), \(g=0,1,2,\dots\), is the genus distribution of \(G\). This concept can be extended to include nonorientable embeddings. The authors determine the extended embedding distributions for several classes of graphs. The computations in the nonorientable case are done by applying a theorem of the reviewer [An obstruction to embedding graphs in surfaces, Discrete Math. 78, No. 1/2, 135-142 (1989; Zbl 0686.05019)] that relates the topological types of embedding surfaces to ranks of the corresponding overlap matrices.
- An obstruction to embedding graphs in surfaces
- Total embedding distributions for two graph families obtained from the dipole \(D_3\).
- Distribution of embeddings
- Orientable embedding distributions by genus for certain type of non-planar graphs. II
- An Euler-genus approach to the calculation of the crosscap-number polynomial
- An obstruction to embedding graphs in surfaces
- Genus distributions for bouquets of circles
- Genus distributions for two classes of graphs
- Hierarchy for imbedding-distribution invariants of a graph
- How to determine the maximum genus of a graph
- scientific article; zbMATH DE number 4170851 (Why is no real title available?)
- scientific article; zbMATH DE number 4006288 (Why is no real title available?)
- scientific article; zbMATH DE number 42721 (Why is no real title available?)
- scientific article; zbMATH DE number 3588683 (Why is no real title available?)
- Kuratowski-type theorems for average genus
- Limit points for average genus. I: 3-connected and 2-connected simplicial graphs
- Limit points for average genus. II: 2-connected non-simplicial graphs
- On the average genus of a graph
- On the surface duality of linear graphs
- An obstruction to embedding graphs in surfaces
- Enumeration of graph embeddings
- Embedding distributions and Chebyshev polynomials
- Genus distributions for several types of ladder-class graphs
- Limits for embedding distributions
- Limit for the Euler-genus distributions of ladder-like sequences of graphs
- Extended graph rotation systems as a model for cyclic weaving on orientable surfaces
- On the average crosscap number. II: Bounds for a graph
- 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 total embedding distributions of cacti and necklaces
- Total embedding distributions for two graph families obtained from the dipole \(D_3\).
- Total embedding distributions of circular ladders
- Log-concavity of genus distributions for circular ladders
- Hierarchy for imbedding-distribution invariants of a graph
- Total embedding distributions of Ringel ladders
- Genus distribution of \(P_3 \mathop\square P_n\)
- Genus distributions of star-ladders
- An Euler-genus approach to the calculation of the crosscap-number polynomial
- Enumerating graph embeddings and partial-duals by genus and Euler genus
- Critical imbeddings with multivariate rearrangements
- Graph ear decompositions and graph embeddings
- Counting orientable embeddings by genus for a type of 3-regular graph
- Strong log-convexity of genus sequences
- The genus polynomials of cross-ladder digraphs in orientable surfaces
- Number of embeddings of circular and Möbius ladders on surfaces
This page was built for publication: Overlap matrices and total imbedding distributions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1322173)
