Overlap matrices and total imbedding distributions

@article{Chen1994OverlapMA,
  title={Overlap matrices and total imbedding distributions},
  author={J. Chen and J. Gross and Robert G. Rieper},
  journal={Discret. Math.},
  year={1994},
  volume={128},
  pages={73-94}
}
Abstract The concept of genus distribution of graphs is generalized to include nonorientable imbeddings. Explicit computations of the total imbedding distributions for several interesting graph classes are given. These computations are an illustration of the power of a theorem by Mohar that relates topological types of imbedding surfaces to ranks of the corresponding overlap matrices. 
54 Citations

Topics from this paper

Embedding Distributions of Generalized Fan Graphs
  • 16
  • Highly Influenced
  • PDF
Genus distributions of orientable embeddings for two types of graphs
  • 2
  • PDF
Genus distribution of graph amalgamations: self-pasting at root-vertices
  • J. Gross
  • Computer Science, Mathematics
  • Australas. J Comb.
  • 2011
  • 24
  • PDF
Total Embedding Distributions of Circular Ladders
  • 9
  • PDF
Log‐concavity of genus distributions for circular ladders
  • 3
  • PDF
Genus Distribution of Graph Amalgamations: Pasting at Root-Vertices
  • 32
  • PDF
The genus distributions of directed antiladders in orientable surfaces
  • R. Hao, Y. Liu
  • Mathematics, Computer Science
  • Appl. Math. Lett.
  • 2008
  • 12
  • PDF
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 15 REFERENCES
Genus distributions for two classes of graphs
  • 80
  • PDF
Genus distributions for bouquets of circles
  • 111
  • PDF
An obstruction to embedding graphs in surfaces
  • B. Mohar
  • Computer Science, Mathematics
  • Discret. Math.
  • 1989
  • 35
  • PDF
Hierarchy for imbedding-distribution invariants of a graph
  • 104
  • PDF
Graphs, Groups and Surfaces
  • 309
Kuratowski-Type Theorems for Average Genus
  • 28
On the average genus of a graph
  • 22
  • PDF
Limit points for average genus. I. 3-Connected and 2-connected simplicial graphs
  • 31
Limit points for average genus II. 2-Connected non-simplicial graphs
  • 22
...
1
2
...