Relations between edge removing and edge subdivision concerning domination number of a graph
From MaRDI portal
Publication:2420425
DOI10.1016/j.dam.2018.06.035zbMath1414.05229arXiv1409.7508OpenAlexW2963014800MaRDI QIDQ2420425
Rita E. Zuazua, Joaquín Tey, Magdalena Lemańska
Publication date: 6 June 2019
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1409.7508
treeVizing's conjecturedomination number\(\gamma_{\mathrm{sd}}\)-critical graph\(\gamma\)-insensitive graphedge removingedge subdividingefficient graph
Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Connectivity (05C40)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Domination alteration sets in graphs
- An extremal problem for edge domination insensitive graphs
- New results about the bondage number of a graph
- Changing and unchanging domination: A classification
- A survey on graphs which have equal domination and closed neighbourhood packing numbers
- Domination and independence subdivision numbers of graphs
- On the domination of the products of graphs II: Trees
- Domination Subdivision Numbers
- Domination critical graphs
This page was built for publication: Relations between edge removing and edge subdivision concerning domination number of a graph