On graphs with equal domination and 2-domination numbers
Let \(G\) be a simple graph, and let \(p\) be a positive integer. A subset \(D\subseteq V(G)\) is a p-dominating set of the graph \(G\), if every vertex \(v\in V(G)-D\) is adjacent to at least \(p\) vertices in \(D\). The \(p\)-domination number \(\gamma_p(G)\) is the minimum cardinality among the \(p\)-dominating sets of \(G\). Note that the 1-domination number \(\gamma_1(G)\) is the usual domination number \(\gamma(G)\). This definition immediately leads to the inequality \(\gamma(G)\leq \gamma_2(G)\). In this paper we present some sufficient as well as some necessary conditions for graphs \(G\) with the property that \(\gamma_2(G)=\gamma(G)\). In particular, we characterize all cactus graphs \(H\) with \(\gamma_2(H)=\gamma(H)\).
- Lower bounds on the p-domination number in terms of cycles and matching number
- On 2-domination and independence domination numbers of graphs.
- scientific article; zbMATH DE number 5543124
- Characterization of block graphs with equal 2-domination number and domination number plus one
- On the p-domination number of cactus graphs
- Bounds of the 2-domination number of graphs
- Characterization of graphs with equal domination and covering number
- Estimations for the number of cycles in a graph
- Graph-theoretic parameters concerning domination, independence, and irredundance
- scientific article; zbMATH DE number 3914370 (Why is no real title available?)
- scientific article; zbMATH DE number 3914371 (Why is no real title available?)
- scientific article; zbMATH DE number 1095171 (Why is no real title available?)
- scientific article; zbMATH DE number 1095172 (Why is no real title available?)
- On graphs with equal domination and connected domination numbers
- On graphs with equal domination and covering numbers
- Bipartite graphs with close domination and \(k\)-domination numbers
- On \(k\)-domination and \(j\)-independence in graphs
- On trees with equal 2-domination and 2-outer-independent domination numbers
- Domination and convexity problems in the target set selection model
- On 2-domination and independence domination numbers of graphs.
- scientific article; zbMATH DE number 6376547 (Why is no real title available?)
- Varieties of Roman Domination
- Multiple domination
- Starred Italian domination in graphs
- Bounds of the 2-domination number of graphs
- Lower bounds on the p-domination number in terms of cycles and matching number
- On the ratio between 2-domination and total outer-independent domination numbers of trees
- Characterization of outerplanar graphs with equal 2-domination and domination numbers
- On disjunctive domination in graphs
- Characterization of block graphs with equal 2-domination number and domination number plus one
- On the p-domination number of cactus graphs
- Complete characterizations of the 2-domination and \(\mathcal{P}_3\)-hull number polytopes
- An upper bound on the 2-outer-independent domination number of a tree
- \(k\)-domination and \(k\)-independence in graphs: A survey
- (1,2)-PDS in graphs with the small number of vertices of large degrees
- On the equality of domination number and 2-domination number
- Complexity analysis of P₃-convexity problems on bounded-degree and planar graphs
This page was built for publication: On graphs with equal domination and 2-domination numbers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2483412)
