scientific article; zbMATH DE number 1406878

From MaRDI portal
Publication:4940764





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.












This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4940764)