New upper bounds for the bondage number of a graph in terms of its maximum degree and Euler characteristic

zbMath1488.05136arXiv2002.00765MaRDI QIDQ4683306

Jia Huang, Jian Shen

Publication date: 20 September 2018

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

zbMATH Keywords

Euler characteristicsizeordergirthgenusgraph embeddingbondage numberEuler formula

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Planar graphs; geometric and topological aspects of graph theory (05C10) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Vertex degrees (05C07)

This page was built for publication: New upper bounds for the bondage number of a graph in terms of its maximum degree and Euler characteristic