The paired domination multisubdivision number of a nonempty graph G, denoted by msdpr(G), is the smallest positive integer k such that there exists an edge which must be subdivided k times to increase the paired domination number of G. It is known that msdpr(G) ≤ 4 for all graphs G. We characterize block graphs with msdpr(G) = 4.
Authors
- Christina M. Mynhardt,
- dr inż. Joanna Raczek link open in new tab
Additional information
- DOI
- Digital Object Identifier link open in new tab 10.7151/dmgt.2230
- Category
- Publikacja w czasopiśmie
- Type
- artykuły w czasopismach
- Language
- angielski
- Publication year
- 2021
