On Partition Dimension and Domination of Abid-Waheed 〖(AW)〗_r^4 Graph
A graph denoted by H, which has a simple link between its vertices, possesses the set of vertices V(H) . Given a graph, a set that is dominant, is a subset of vertex set such that any vertex outside of is close to at least one vertex inside of . The smallest size of for the dominating set is kn...
Uloženo v:
| Hlavní autoři: | , , , |
|---|---|
| Médium: | Artigo |
| Jazyk: | Inglês |
| Vydáno: |
University of Baghdad, College of Science for Women
2024-05-01
|
| Edice: | مجلة بغداد للعلوم |
| Témata: | |
| On-line přístup: | https://bsj.uobaghdad.edu.iq/index.php/BSJ/article/view/8378 |
| Tagy: |
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
|