Algorithmic Complexity and Bounds for Domination Subdivision Numbers of Graphs
Let G=V,E be a simple graph. A subset D⊆V is a dominating set if every vertex not in D is adjacent to a vertex in D. The domination number of G, denoted by γG, is the smallest cardinality of a dominating set of G. The domination subdivision number sdγG of G is the minimum number of edges that must b...
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Hindawi Limited
2024-01-01
|
| Series: | Journal of Mathematics |
| Online Access: | http://dx.doi.org/10.1155/2024/3795448 |