Note on the bondage number of graphs on topological surfaces
From MaRDI portal
Publication:2848734
Abstract: The bondage number b(G) of a graph G is the smallest number of edges whose removal from G results in a graph with larger domination number. In this paper we present new upper bounds for b(G) in terms of girth, order and Euler characteristic.
Recommendations
- Upper bounds for the bondage number of graphs on topological surfaces
- Upper bounds on the bondage number of a graph
- New upper bounds for the bondage number of a graph in terms of its maximum degree and Euler characteristic.
- The bondage number of graphs on topological surfaces and Teschner's conjecture
- An improved upper bound for the bondage number of graphs on surfaces
Cited in
(12)- New upper bounds for the bondage number of a graph in terms of its maximum degree and Euler characteristic.
- On bondage number of toroidal graphs
- Upper bounds on the bondage number of a graph
- Note on conjectures of bondage numbers of planar graphs
- An improved upper bound for the bondage number of graphs on surfaces
- The distinguishing numbers of graphs on closed surfaces
- On bondage numbers of graphs: a survey with some comments
- Upper bounds for domination related parameters in graphs on surfaces
- A note on the 2-rainbow bondage numbers in graphs
- The bondage number of graphs on topological surfaces and Teschner's conjecture
- Upper bounds for the domination subdivision and bondage numbers of graphs on topological surfaces.
- Upper bounds for the bondage number of graphs on topological surfaces
This page was built for publication: Note on the bondage number of graphs on topological surfaces
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2848734)