Overlap matrices and total imbedding distributions

DOI10.1016/0012-365X(94)90105-8zbMath0798.05017WikidataQ126297073 ScholiaQ126297073MaRDI QIDQ1322173

Robert G. Rieper, Jonathan L. Gross, Jian'er Chen

Publication date: 5 May 1994

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

genus distributionembedding distributionsembedding surfacesoverlap matrices

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)

Related Items (21)

On the average crosscap number. II: Bounds for a graph ⋮ Enumeration of graph embeddings ⋮ Log-concavity of genus distributions for circular ladders ⋮ Embedding distributions and Chebyshev polynomials ⋮ Enumerating graph embeddings and partial-duals by genus and Euler genus ⋮ Total embedding distributions of Ringel ladders ⋮ Graph ear decompositions and graph embeddings ⋮ Genus distribution of \(P_3 \mathop\square P_n\) ⋮ Genus distributions of star-ladders ⋮ Counting orientable embeddings by genus for a type of 3-regular graph ⋮ The genus polynomials of cross-ladder digraphs in orientable surfaces ⋮ Orientable embedding genus distribution for certain types of graphs ⋮ Limit for the Euler-genus distributions of ladder-like sequences of graphs ⋮ Genus distributions for several types of ladder-class graphs ⋮ The genus distributions of directed antiladders in orientable surfaces ⋮ The genus distributions for a certain type of permutation graphs in orientable surfaces ⋮ Limits for embedding distributions ⋮ Number of embeddings of circular and Möbius ladders on surfaces ⋮ The total embedding distributions of cacti and necklaces ⋮ Total Embedding Distributions of Circular Ladders ⋮ Extended graph rotation systems as a model for cyclic weaving on orientable surfaces

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Limit points for average genus. I: 3-connected and 2-connected simplicial graphs
• Genus distributions for two classes of graphs
• Limit points for average genus. II: 2-connected non-simplicial graphs
• Kuratowski-type theorems for average genus
• How to determine the maximum genus of a graph
• An obstruction to embedding graphs in surfaces
• Genus distributions for bouquets of circles
• On the average genus of a graph
• Hierarchy for imbedding-distribution invariants of a graph
• On the surface duality of linear graphs

This page was built for publication: Overlap matrices and total imbedding distributions