## GENUS DISTRIBUTIONS OF STAR-LADDERS

### BibTeX

@MISC{Chen_genusdistributions,

author = {Yichao Chen and Jonathan L. Gross and Toufik Mansour},

title = {GENUS DISTRIBUTIONS OF STAR-LADDERS},

year = {}

}

### OpenURL

### Abstract

Abstract. Star-ladder graphs were introduced by Gross in his development of a quadratic-time algorithm for the genus distribution of a cubic outerplanar graph. This paper derives a formula for the genus distribution of star-ladder graphs, using Mohar’s overlap matrix and Chebyshev polynomials. Newly developed methods have led to a number of recent papers that derive genus distributions and total embedding distributions for various families of graphs. Our focus here is on a family of graphs called star-ladders. 1.

### Citations

309 |
Topological graph theory
- Gross, Tucker
(Show Context)
Citation Context ...own in Figure 2. Figure 2. The star-ladder SL2,1,0. 1.2. Genus polynomial. It is assumed that the reader is somewhat familiar with the basics of topological graph theory, as found in Gross and Tucker =-=[7]-=-. All graphs considered in this paper are connected. A graph G = (V (G), E(G)) is permitted to have both loops and multiple edges. A surface is a compact 2-manifold without boundary. In topology, surf... |

88 |
Map Color Theorem
- Ringel
- 1974
(Show Context)
Citation Context ...f a spanning tree. For drawing a planar representation of a rotation system on a cubic graph, we adopt the graphic convention introduced by Gustin [13], and used extensively by Ringel and Youngs (see =-=[21]-=-) in their solution to the Heawood map-coloring problem. There are two possible cyclic orderings of each trivalent vertex. Under this convention, we color a vertex black, if the rotation of the edge-e... |

29 |
Genus distributions for bouquets of circles
- Gross, Robbins, et al.
- 1989
(Show Context)
Citation Context ...-ladders. 1. Introduction Genus distributions problems have frequently been investigated in the past quarter century, since the topic was inaugurated by Gross and Furst [6]. The contributions include =-=[1, 5, 8, 9, 10, 11, 12, 14, 15, 16, 18, 19, 20, 22, 23, 24, 25, 26]-=- and [27]. Gross [11] presents a quadratic-time algorithm for computing the genus distribution of any cubic outerplanar graph. He analyzes the structure of any cubic outerplanar graph and finds that s... |

26 |
Hierarchy for imbedding-distribution invariants of a graph
- Gross, Furst
- 1987
(Show Context)
Citation Context ... a family of graphs called star-ladders. 1. Introduction Genus distributions problems have frequently been investigated in the past quarter century, since the topic was inaugurated by Gross and Furst =-=[6]-=-. The contributions include [1, 5, 8, 9, 10, 11, 12, 14, 15, 16, 18, 19, 20, 22, 23, 24, 25, 26] and [27]. Gross [11] presents a quadratic-time algorithm for computing the genus distribution of any cu... |

24 |
Genus distributions for two classes of graphs
- Furst, Gross, et al.
- 1989
(Show Context)
Citation Context ...-ladders. 1. Introduction Genus distributions problems have frequently been investigated in the past quarter century, since the topic was inaugurated by Gross and Furst [6]. The contributions include =-=[1, 5, 8, 9, 10, 11, 12, 14, 15, 16, 18, 19, 20, 22, 23, 24, 25, 26]-=- and [27]. Gross [11] presents a quadratic-time algorithm for computing the genus distribution of any cubic outerplanar graph. He analyzes the structure of any cubic outerplanar graph and finds that s... |

17 |
Genus distribution for Ringel ladders
- Tesar
(Show Context)
Citation Context ...-ladders. 1. Introduction Genus distributions problems have frequently been investigated in the past quarter century, since the topic was inaugurated by Gross and Furst [6]. The contributions include =-=[1, 5, 8, 9, 10, 11, 12, 14, 15, 16, 18, 19, 20, 22, 23, 24, 25, 26]-=- and [27]. Gross [11] presents a quadratic-time algorithm for computing the genus distribution of any cubic outerplanar graph. He analyzes the structure of any cubic outerplanar graph and finds that s... |

17 |
Orientable embedding genus distribution for certain types of graphs
- Wan, Liu
- 2008
(Show Context)
Citation Context ...en investigated in the past quarter century, since the topic was inaugurated by Gross and Furst [6]. The contributions include [1, 5, 8, 9, 10, 11, 12, 14, 15, 16, 18, 19, 20, 22, 23, 24, 25, 26] and =-=[27]-=-. Gross [11] presents a quadratic-time algorithm for computing the genus distribution of any cubic outerplanar graph. He analyzes the structure of any cubic outerplanar graph and finds that such a gra... |

16 |
Genus polynomials of dipoles
- Kwak, Lee
- 1993
(Show Context)
Citation Context |

15 |
Region distributions of graph embeddings and Stirling numbers
- Stahl
- 1990
(Show Context)
Citation Context |

14 |
Algorithms for two graph problems: computing maximum-genus imbeddings and the two-server problem
- McGeoch
- 1987
(Show Context)
Citation Context |

14 |
Permutation-partition pairs. III. Embedding distributions of linear families of graphs
- Stahl
- 1991
(Show Context)
Citation Context |

12 | Genus distributions of cubic outerplanar graphs
- Gross
(Show Context)
Citation Context |

11 | Genus distribution of graph amalgamations: Pasting at root-vertices, Ars Combin
- Gross, Khan, et al.
(Show Context)
Citation Context |

11 | Genus distribution of graphs under surgery: adding edges and splitting vertices
- Gross
(Show Context)
Citation Context |

11 | Genus distribution of graph amalgamations: Self-pasting at root-vertices
- Gross
- 2011
(Show Context)
Citation Context |

11 |
Region distributions of some small diameter graphs
- Stahl
- 1991
(Show Context)
Citation Context |

10 | On the genus distribution of (p, q, n)-dipoles
- Visentin, Wieler
(Show Context)
Citation Context |

9 | Genus distribution of graph amalgamations: Pasting when one root has arbitrary degree
- Khan, Poshni, et al.
(Show Context)
Citation Context |

8 |
Face-width of embedded graphs
- Mohar
- 1997
(Show Context)
Citation Context ...sed formula for the genus distribution of the cubic outerplanar graphs. Our closed formula in this paper for the genus distribution of star-ladders is derived with the aid of Mohar’s overlap matrices =-=[17]-=-. 1.1. Star-ladders. An n-rung closed-end ladder Ln can be obtained by taking the graphical cartesian product of an n-vertex path with the complete graph K2, and then doubling both its end edges. The ... |

8 | Genus distribution of graphs under self-edge-amalgamations
- Poshni, Khan, et al.
(Show Context)
Citation Context |

7 | Genus distribution of 4-regular outerplanar graphs
- Poshni, Khan, et al.
(Show Context)
Citation Context |

6 |
Genus distribution of edge-amalgamations
- Poshni, Khan, et al.
(Show Context)
Citation Context |

4 |
Overlap matrices and total embeddings, Discrete Math
- Chen, Gross, et al.
- 1994
(Show Context)
Citation Context ...re gi(G) means the number of embeddings of G into the orientable surface Si, for i ≥ 0. 1.3. Overlap matrices. Mohar [17] introduced an invariant that has subsequently been used numerous times (e.g., =-=[2, 3, 4]-=-) in the calculation of distributions of graph embeddings, including non-orientable embeddings. We use Mohar’s invariant here in our derivation of a formula for the genus distribution of star-ladders.... |

4 |
Embedding distributions and Chebyshev polynomial
- Chen, Mansour, et al.
(Show Context)
Citation Context ...re gi(G) means the number of embeddings of G into the orientable surface Si, for i ≥ 0. 1.3. Overlap matrices. Mohar [17] introduced an invariant that has subsequently been used numerous times (e.g., =-=[2, 3, 4]-=-) in the calculation of distributions of graph embeddings, including non-orientable embeddings. We use Mohar’s invariant here in our derivation of a formula for the genus distribution of star-ladders.... |

4 |
Total embedding distributions of Ringel ladders
- Chen, Ou, et al.
(Show Context)
Citation Context ...re gi(G) means the number of embeddings of G into the orientable surface Si, for i ≥ 0. 1.3. Overlap matrices. Mohar [17] introduced an invariant that has subsequently been used numerous times (e.g., =-=[2, 3, 4]-=-) in the calculation of distributions of graph embeddings, including non-orientable embeddings. We use Mohar’s invariant here in our derivation of a formula for the genus distribution of star-ladders.... |

3 |
Calculations on the average genus and genus distribution of graphs
- Archdeacon
- 1988
(Show Context)
Citation Context |

3 |
Orientable embedding of Cayley graphs
- Gustin
- 1963
(Show Context)
Citation Context ...er otherwise. The rank is independent of the choice of a spanning tree. For drawing a planar representation of a rotation system on a cubic graph, we adopt the graphic convention introduced by Gustin =-=[13]-=-, and used extensively by Ringel and Youngs (see [21]) in their solution to the Heawood map-coloring problem. There are two possible cyclic orderings of each trivalent vertex. Under this convention, w... |