An improved upper bound for the bondage number of graphs on surfaces
From MaRDI portal
Publication:449115
DOI10.1016/j.disc.2012.05.012zbMath1248.05140arXiv1111.5629OpenAlexW2020447305MaRDI QIDQ449115
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
Extremal problems in graph theory (05C35) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)
Related Items (3)
Structurally stable output regulation of nonlinear systems ⋮ On bondage numbers of graphs: a survey with some comments ⋮ Upper bounds on the bondage number of a graph
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Upper bounds for the bondage number of graphs on topological surfaces
- On the complexity of the bondage and reinforcement problems
- Domination alteration sets in graphs
- The bondage number of a graph
- Bounds on the bondage number of a graph
- Bondage number of planar graphs
- On the bondage number of planar and directed graphs
This page was built for publication: An improved upper bound for the bondage number of graphs on surfaces
