Split Domination Number in Edge Semi-Middle Graph
Let G = (p, q) be a connected graph and Me(G) be its corresponding edge semi-middle graph. A dominating set D ⊆ V [Me(G)] is split dominating set V [Me(G)] – D is disconnected. The minimum size of D is called the split domination number of Me(G) and is denoted by γs[Me(G)]. In this paper we obtain s...
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Mathyze Publishers
2022-09-01
|
| Series: | Pan-American Journal of Mathematics |
| Online Access: | https://mathyze.com/index.php/pajm/article/view/50 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|