Overlap matrices and total imbedding distributions

AbstractThe 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