Γ-independent dominating graphs of paths and cycles
A set D of vertices in a graph G is an independent dominating set if D is a set of pairwise nonadjacent vertices of G such that every vertex of G not in D is adjacent to at least one vertex in D. An independent dominating set D is minimal if no proper subset of D is an independent dominating set....
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Prince of Songkla University
2024-08-01
|
| Series: | Songklanakarin Journal of Science and Technology (SJST) |
| Subjects: | |
| Online Access: | https://sjst.psu.ac.th/journal/46-4/9.pdf |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|