Real and integer domination in graphs (Q1297432): Difference between revisions

The \(P\)-domination number of a graph is a certain variant of the domination number. Let \(G\) be a graph and \(P\) a subset of the set \(\mathbb{R}\) of all real numbers. A function \(f: V\to P\), where \(V\) is the vertex set of \(G\), is called \(P\)-dominating in \(G\), if the sum of its values over the closed neighbourhood \(N[v]\) of an arbitrary vertex \(v\in V\) is at least 1. The weight \(w(f)\) is defined by \(\sum_{x\in V} f(x)\). The minimum of \(w(f)\) taken over all \(P\)-dominating functions \(f\) on \(G\) is the \(P\)-domination number \(\gamma_P(G)\) of \(G\). The paper studies the cases when \(P\) is the set \(\mathbb{R}\) of real numbers, the set \(\mathbb{Q}\) of rational numbers or an interval on the set of integers. At the end analogously introduced variants of other numerical invariants of graphs are treated, e.g., the \(P\)-independence number.