Open Access. Powered by Scholars. Published by Universities.®
Physical Sciences and Mathematics Commons™
Open Access. Powered by Scholars. Published by Universities.®
Articles 1 - 1 of 1
Full-Text Articles in Physical Sciences and Mathematics
Cost Domination In Graphs, David John Erwin
Cost Domination In Graphs, David John Erwin
Dissertations
Let G be a connected graph having order at least 2. A function f : V (G) —> {0 , 1 , . . . , diam G} for which f ( v ) < e(v) for every vertex v of G is a cost function on G. A vertex v with f ( v ) > 0 is an f-dominating vertex, and the set Vj~ = {v 6 V(G) : f(v) > 0} of f-dominating vertices is the f-dominating set. An /-dominating vertex v is said to f-dominate every vertex u with d(n, v) < f(u ), while …