General Bounds on the Downhill Domination Number in Graphs.
A path π = (v1, v2,...vk+1) in a graph G = (V,E) is a downhill path if for every i, 1 < i < k, deg(vi) > deg(vi+1), where deg(vi) denotes the degree of vertex vi ∊ V. The downhill domination number equals the minimum cardinality of a set S ⊂ V having the property that every vertex v ∊ V lie...
| Main Author: | |
|---|---|
| Format: | Others |
| Published: |
Digital Commons @ East Tennessee State University
2013
|
| Subjects: | |
| Online Access: | https://dc.etsu.edu/honors/107 https://dc.etsu.edu/cgi/viewcontent.cgi?article=1111&context=honors |