441 research outputs found
Self-dual Embeddings of K_{4m,4n} in Different Orientable and Nonorientable Pseudosurfaces with the Same Euler Characteristic
A proper embedding of a graph G in a pseudosurface P is an embedding in which the regions of the complement of G in P are homeomorphic to discs and a vertex of G appears at each pinchpoint in P; we say that a proper embedding of G in P is self dual if there exists an isomorphism from G to its dual graph. We give an explicit construction of a self-dual embedding of the complete bipartite graph K_{4m,4n} in an orientable pseudosurface for all ; we show that this embedding maximizes the number of umbrellas of each vertex and has the property that for any vertex v of K_{4m,4n}, there are two faces of the constructed embedding that intersect all umbrellas of v. Leveraging these properties and applying a lemma of Bruhn and Diestel, we apply a surgery introduced here or a different known surgery of Edmonds to each of our constructed embeddings for which at least one of m or n is at least 2. The result of these surgeries is that there exist distinct orientable and nonorientable pseudosurfaces with the same Euler characteristic that feature a self-dual embedding of K_{4m,4n}
Stratified graphs for imbedding systems
AbstractTwo imbeddings of a graph G are considered to be adjacent if the second can be obtained from the first by moving one or both ends of a single edge within its or their respective rotations. Thus, a collection of imbeddings S of G, called a ‘system’, may be represented as a ‘stratified graph’, and denoted SG; the focus here is the case in which S is the collection of all orientable imbeddings. The induced subgraph of SG on the set of imbeddings into the surface of genus k is called the ‘kth stratum’, and the cardinality of that set of imbeddings is called the ‘stratum size’; one may observe that the sequence of stratum sizes is precisely the genus distribution for the graph G. It is known that the genus distribution is not a complete invariant, even when the category of graphs is restricted to be simplicial and 3-connected. However, it is proved herein that the link of each point — that is, the subgraph induced by its neighbors — of SG is a complete isomorphism invariant for the category of graphs whose minimum valence is at least three. This supports the plausibility of a probabilistic approach to graph isomorphism testing by sampling higher-order imbedding distribution data. A detailed structural analysis of stratified graphs is presented
- …