Paired-Domination in Grid Graphs.
Every graph G = (V, E) has a dominating set S ⊆ V(G) such that any vertex not in S is adjacent to a vertex in S. We define a paired-dominating set S to be a dominating set S = {v1, v2,..., v2t-1, v2t} where M = {v1v2, v3v4, ..., v2t-1v2t} is a perfect matching in 〈S〉, the subgraph induced by S. The...
| Main Author: | |
|---|---|
| Format: | Others |
| Published: |
Digital Commons @ East Tennessee State University
2001
|
| Subjects: | |
| Online Access: | https://dc.etsu.edu/etd/131 https://dc.etsu.edu/cgi/viewcontent.cgi?article=1181&context=etd |