Variant Domination Types for a Complete h-ary Tree
Graph is a tool that can be used to simplify and solve network problems. Domination is a typical network problem that graph theory is well suited for. A subset of nodes in any network is called dominating if every node is contained in this subset, or is connected to a node in it via an edge. Becaus...
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
University of Baghdad, College of Science for Women
2021-03-01
|
| Series: | مجلة بغداد للعلوم |
| Subjects: | |
| Online Access: | https://bsj.uobaghdad.edu.iq/index.php/BSJ/article/view/3481 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|