Search
Abstract
A set X is weakly convex in G if for any two vertices a; b \in X there exists an ab–geodesic such that all of its vertices belong to X. A set X \subset V is a weakly convex dominating set if X is weakly convex and dominating. The weakly convex domination number \gamma_wcon(G) of a graph G equals the minimum cardinality of a weakly convex dominating set in G. The weakly convex domination subdivision number sd_wcon (G) is the minimum number of edges that must be subdivided (each edge in G can be subdivided at most once) in order to increase the weakly convex domination number. In this paper we initiate the study of weakly convex domination subdivision number and establish upper bounds for it.
Citations
-
2
CrossRef
-
0
Web of Science
-
4
Scopus
Authors (4)
-
Saeed Kosary
- Azarbaijan Shahid Madani University Department of Mathematics
-
Seyed Sheikholeslami
- Azarbaijan Shahid Madani University Department of Mathematics
Cite as
Full text
download paper
downloaded 36 times
- Publication version
- Accepted or Published Version
- License
- Copyright (Copyright by Faculty of Sciences and Mathematics, University of Nis 2016)
Keywords
Details
- Category:
- Articles
- Type:
- artykuł w czasopiśmie wyróżnionym w JCR
- Published in:
-
FILOMAT
no. 30,
edition 8,
pages 2101 - 2110,
ISSN: 0354-5180 - Language:
- English
- Publication year:
- 2016
- Bibliographic description:
- Dettlaff M., Kosary S., Lemańska M., Sheikholeslami S.: Weakly convex domination subdivision number of a graph// FILOMAT. -Vol. 30, iss. 8 (2016), s.2101-2110
- DOI:
- Digital Object Identifier (open in new tab) 10.2298/fil1608101d
- Verified by:
- Gdańsk University of Technology
seen 140 times
Recommended for you
The convex domination subdivision number of a graph
- M. Dettlaff,
- M. Lemańska,
- S. Kosary
- + 1 authors
2016
On the connected and weakly convex domination numbers
- M. Lemańska,
- M. Dettlaff,
- D. Osula
- + 1 authors
2020