Bounds for the average genus of the vertex-amalgamation of graphs (Q1896359)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Bounds for the average genus of the vertex-amalgamation of graphs |
scientific article |
Statements
Bounds for the average genus of the vertex-amalgamation of graphs (English)
0 references
11 December 1995
0 references
The extent to which the average genus of the amalgamation of graphs fails to be additive over its constituent subgraphs is studied. The discrepancy is bounded, and the sharpness of the bounds is discussed and compared to similar bounds for the genus and maximum genus parameters for graph amalgamations. The main theorem is proved using permutation-partition pairs; see the author [Trans. Am. Math. Soc. 259, 129-145 (1980; Zbl 0441.05024) and ibid. 271, 175-182 (1982; Zbl 0495.05019)].
0 references
average genus
0 references
amalgamation of graphs
0 references
bounds
0 references
graph amalgamations
0 references
permutation-partition pairs
0 references
