The average Euler-genus of the vertex-amalgamation of signed graphs
Combinatorics
2022-05-03 v2
Abstract
In this paper, we first generalize a theorem for counting the number of faces of an oriented embedding of a graph that passing through a given cut-edge set [S. Stahl, Trans. Amer. Math. Soc. 259 (1980), 129--145] to all surfaces. Then we extend Stahl's bounds for the average genus of the vertex-amalgamation of graphs [S. Stahl, Discrete Math. 142 (1995), 235--245] to signed graphs.
Keywords
Cite
@article{arxiv.2204.06985,
title = {The average Euler-genus of the vertex-amalgamation of signed graphs},
author = {Yichao Chen},
journal= {arXiv preprint arXiv:2204.06985},
year = {2022}
}
Comments
11pages,3figures