An improved upper bound for the bondage number of graphs on surfaces

DOI10.1016/j.disc.2012.05.012zbMath1248.05140arXiv1111.5629MaRDI QIDQ449115

Jia Huang

Publication date: 12 September 2012

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1111.5629

zbMATH Keywords

Euler characteristic; girth; genus; Euler's formula; graph embedding; bondage number

Mathematics Subject Classification ID

05C35: Extremal problems in graph theory

05C69: Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.)

05C60: Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.)

Related Items

Structurally stable output regulation of nonlinear systems