Minimum Neighborhood Domination of Split Graph of Graphs
Let be a non-trivial simple graph. A dominating set in a graph is a set of vertices such that every vertex not in the set is adjacent to at least one vertex in the set. A subset is a minimum neighborhood dominating set if is a dominating set and if for every holds. The minimum cardinality of th...
| मुख्य लेखकों: | , |
|---|---|
| स्वरूप: | लेख |
| भाषा: | Arabic |
| प्रकाशित: |
College of Science for Women, University of Baghdad
2023-03-01
|
| श्रृंखला: | Baghdad Science Journal |
| विषय: | |
| ऑनलाइन पहुंच: | https://bsj.uobaghdad.edu.iq/index.php/BSJ/article/view/8404 |