Genus distribution of graph amalgamations: Pasting when one root has arbitrary degree

Imran F. Khan, Mehvish I. Poshni, Jonathan L. Gross

Abstract


This paper concerns counting the imbeddings of a graph in a surface. In the first installment of our current work, we showed how to calculate the genus distribution of an iterated amalgamation of copies of a graph whose genus distribution is already known and is further analyzed into a partitioned genus distribution (which is defined for a double-rooted graph). Our methods were restricted there to the case with two 2-valent roots. In this sequel we substantially extend the method in order to allow one of the two roots to have arbitrarily high valence. 

Keywords


Graph, genus distribution, vertex-amalgamation

Full Text:

PDF ABSTRACTS (EN/SI)


DOI: https://doi.org/10.26493/1855-3974.111.e89

ISSN: 1855-3974

Issues from Vol 6, No 1 onward are partially supported by the Slovenian Research Agency from the Call for co-financing of scientific periodical publications