Search
Abstract
In this paper we study relations between connected and weakly convex domination numbers. We show that in general the difference between these numbers can be arbitrarily large and we focus on the graphs for which a weakly convex domination number equals a connected domination number. We also study the influence of the edge removing on the weakly convex domination number, in particular we show that a weakly convex domination number is an interpolating function.
Authors (4)
-
-
Maria Jose Souto Salorio prof
Cite as
Full text
download paper
downloaded 42 times
- Publication version
- Accepted or Published Version
- License
- Copyright (2020 Charles Babbage Research Centre)
Keywords
Details
- Category:
- Articles
- Type:
- artykuły w czasopismach
- Published in:
-
Journal of Combinatorial Mathematics and Combinatorial Computing
no. 115,
pages 227 - 243,
ISSN: 0835-3026 - Language:
- English
- Publication year:
- 2020
- Bibliographic description:
- Lemańska M., Dettlaff M., Osula D., Souto Salorio M. J.: On the connected and weakly convex domination numbers// Journal of Combinatorial Mathematics and Combinatorial Computing -Vol. 115, (2020), s.227-243
- Verified by:
- Gdańsk University of Technology
seen 85 times
Recommended for you
Weakly convex domination subdivision number of a graph
- M. Dettlaff,
- S. Kosary,
- M. Lemańska
- + 1 authors
2016
Similarities and Differences Between the Vertex Cover Number and the Weakly Connected Domination Number of a Graph
- M. Lemańska,
- J. A. RODRíGUEZ-VELáZQUEZ,
- R. Trujillo-Rasua
2017