Edge subdivision and edge multisubdivision versus some domination related parameters in generalized corona graphs
Abstract
Given a graph G= (V, E), the subdivision of an edge e=uv∈E(G) means the substitution of the edge e by a vertex x and the new edges ux and xv. The domination subdivision number of a graph G is the minimum number of edges of G which must be subdivided (where each edge can be subdivided at most once) in order to increase the domination number. Also, the domination multisubdivision number of G is the minimum number of subdivisions which must be done in one edge such that the domination number increases. Moreover, the concepts of paired domination and independent domination subdivision (respectively multisubdivision) numbers are defined similarly. In this paper we study the domination, paired domination and independent domination (subdivision and multisubdivision) numbers of the generalized corona graphs.
Citations
-
1
CrossRef
-
0
Web of Science
-
5
Scopus
Authors (3)
Cite as
Full text
- Publication version
- Accepted or Published Version
- DOI:
- Digital Object Identifier (open in new tab) 10.7494/OpMath.2016.36.5.575
- License
- open in new tab
Keywords
Details
- Category:
- Articles
- Type:
- artykuły w czasopismach recenzowanych i innych wydawnictwach ciągłych
- Published in:
-
Opuscula Mathematica
no. 36,
edition 5,
pages 575 - 588,
ISSN: 1232-9274 - Language:
- English
- Publication year:
- 2016
- Bibliographic description:
- Dettlaff M., Raczek J., Yero I. G.: Edge subdivision and edge multisubdivision versus some domination related parameters in generalized corona graphs// Opuscula Mathematica. -Vol. 36., iss. 5 (2016), s.575-588
- DOI:
- Digital Object Identifier (open in new tab) 10.7494/opmath.2016.36.5.575
- Verified by:
- Gdańsk University of Technology
seen 145 times
Recommended for you
TOTAL DOMINATION MULTISUBDIVISION NUMBER OF A GRAPH
- D. Avella-alaminos,
- M. Dettlaff,
- M. Lemańska
- + 1 authors