Name
Abstract | ||
|---|---|---|
Let G = (V, E) be a graph and k is an element of Z(+) such that 1 less than or equal to k less than or equal to \V\. A k-subdominating function (kSF) to {-1, 0, 1} is a function f : V --> {-1,0, 1} such that the closed neighborhood sum f(N[v]) greater than or equal to 1 for at least k vertices of G. The weight of a kSF f is f(V) = Sigma(v is an element of V) f(v) . The k-subdomination number to {-1, 0, 1} of a graph G, denoted by gamma(ks)(-101)(G), equals the minimum weight of a kSF of G. In this paper we characterize minimal kSF's, calculate gamma(ks)(-101) for an arbitrary path and determine the least order of a connected graph G for which gamma(ks)(-101)(G) = -m for an arbitrary positive integer m. |
Year | Venue | Field |
|---|---|---|
1998 | ARS COMBINATORIA | Graph,Discrete mathematics,Combinatorics,Mathematics |
DocType | Volume | ISSN |
Journal | 50 | 0381-7032 |
Citations | PageRank | References |
1 | 0.63 | 0 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Izak Broere | 1 | 143 | 31.30 |
| Jean E. Dunbar | 2 | 122 | 18.70 |
| Johannes H. Hattingh | 3 | 229 | 35.41 |