Parity Domination in Product Graphs
An odd open dominating set of a graph is a subset of the graph’s vertices with the property that the open neighborhood of each vertex in the graph contains an odd number of vertices in the subset. An odd closed r-dominating set is a subset of the graph’s vertices with the property that the closed r-...
| Main Author: | |
|---|---|
| Format: | Others |
| Published: |
VCU Scholars Compass
2011
|
| Subjects: | |
| Online Access: | http://scholarscompass.vcu.edu/etd/2522 http://scholarscompass.vcu.edu/cgi/viewcontent.cgi?article=3521&context=etd |