Strong-weak domatic numbers of graphs
If \(u\), \(v\) are adjacent vertices of a graph \(G\) and \(\deg u\geq\deg v\) then \(u\) is said to dominate \(v\) strongly and \(v\) is said to dominate \(u\) weakly. A subset \(D\) of the vertex set \(V\) of \(G\) is called a strongly (or weakly) dominating set in \(G\), if each vertex of \(V\setminus D\) is strongly (or, respectively, weakly) dominated by a vertex of \(D\). The minimum number of vertices of a strongly (or weakly) dominating set in \(G\) is the strong domination number \(\gamma_s(G)\) (or, respectively, the weak domination number \(\gamma_w(G)\)). A strong-weak domatic partition of \(G\) is a partition of \(V\), each class of which is a strongly dominating set, or a weakly dominating set in \(G\). The maximum number of classes of a strong-weak domatic partition of \(G\) is the strong-weak domatic number of \(G\). These concepts, together with the (usual) domination number are studied.
- Pagenumber of pathwidth-k graphs and strong pathwidth-k graphs
- Bounds on the strong domination number
- A note on a relation between the weak and strong domination numbers of a graph
- k-strong k-weak domination in graphs and semigraphs
- Strong and Weak Domination, Full Sets and Domination Balance in Semigraphs
- scientific article; zbMATH DE number 4008449 (Why is no real title available?)
- Inequalities between strong, weak domination numbers and chromatic number of a graph
- scientific article; zbMATH DE number 6161501 (Why is no real title available?)
- On strong domination number of graphs
- On strong and weak domination numbers in graphs
- Weak and strong domination on some graphs
- Weak and strong domination in thorn graphs
- Strong weak domination: a mathematical programming strategy
- Some cycle and star related Nordhaus-Gaddum type relations on strong efficient dominating sets
- Strong vb-dominating and vb-independent sets of a graph
- Strong weak domination in complementary prisms
- scientific article; zbMATH DE number 2197895 (Why is no real title available?)
- scientific article; zbMATH DE number 7671000 (Why is no real title available?)
- On strong (weak) independent sets and vertex coverings of a graph
This page was built for publication: Strong-weak domatic numbers of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1860739)