No label defined (Q4940764)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1406878
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 1406878 |
Statements
27 February 2000
0 references
generalization of domination number of a graph
0 references
0.8058497309684753
0 references
0.8045425415039062
0 references
0.8013153076171875
0 references
Let \(G\) be a graph and let \(k\) be a positive integer. If \(x\in V(G)\), then \(N[x]\) denotes the set of all \(y\in V(G)\) such that either \(y=x\) or \(y\) is adjacent to \(x\). The minimum sum \[ \sum _{u\in V(G)} f(u) \] taken over all functions \(f:V(G)\rightarrow \{0,1/k\}\) with the property that \[ \sum _{y\in N[x]} f(y) \geq 1\quad \text{for each} \quad x\in V(G) \] is denoted by \(\gamma (k,G)\). Clearly, \(\gamma (k,G)\) is defined if and only if \(\delta (G) \geq k-1\), where \(\delta (G)\) denotes the minimum degree of \(G\) (Corollary 1). In this paper \(\gamma (k,G)\) is studied.
0 references