Embedding Distributions of Generalized Fan Graphs
Printed: Jun 2013
Total embedding distributions have been known for a few classes of graphs.
Chen, Gross, and Rieper
computed it for necklaces, close-end ladders and cobblestone
paths. Kwak and Shim computed it for bouquets of circles and
dipoles. In this paper, a splitting theorem is generalized
and the embedding distributions of
generalized fan graphs are obtained.
total embedding distribution, splitting theorem, generalized fan graphs
05C10 - Planar graphs; geometric and topological aspects of graph theory [See also 57M15, 57M25]