On the existence of independent (1,k)-dominating sets for k\1,2\ in two products of graphs
Let \(G\) be a graph. A set \(D\subseteq V(G)\) is an independent set of \(G\) if there are no edges between vertices of \(D\). An independent set \(D\) is an independent \((1,1)\)-dominating set if there exist two different vertices of \(D\) adjacent to every vertex of \(V(G)-D\). Similar is an independent set \(D\), an independent \((1,2)\)-dominating set if every vertex from \(V(G)-D\) is adjacent to one member of \(D\) and is at distance at most two to another vertex from \(D\).\N\NDirect \(G\times H\) and strong product \(G\boxtimes H\) of graphs \(G\) and \(H\) are graph with the same vertex set \(V(G)\times V(H)\). Two vertices \((g,h)\) and \((g',h')\) are adjacent in \(G\times H\) if \(gg'\in E(G)\) and \(hh'\in E(H)\). The strong product contains all edges of a direct product and additionally also edges that project to an edge in one factor and to a vertex in the other factor.\N\NIn the present work, the authors characterize when there exists an independent \((1,1)\)- and an independent \((1,2)\)-dominating sets in direct and strong product of graphs. The conditions do not only depend on the existence of an independent \((1,1)\)- or an independent \((1,2)\)-dominating sets in factors.
- \((1,2)\)-domination in graphs
- Fibonacci numbers in graphs with strong (1, 1, 2)-kernels
- Handbook of product graphs
- scientific article; zbMATH DE number 3914370 (Why is no real title available?)
- scientific article; zbMATH DE number 4085682 (Why is no real title available?)
- scientific article; zbMATH DE number 4095497 (Why is no real title available?)
- scientific article; zbMATH DE number 3536147 (Why is no real title available?)
- scientific article; zbMATH DE number 1095171 (Why is no real title available?)
- scientific article; zbMATH DE number 6739965 (Why is no real title available?)
- scientific article; zbMATH DE number 2203240 (Why is no real title available?)
- scientific article; zbMATH DE number 5238170 (Why is no real title available?)
- scientific article; zbMATH DE number 3400923 (Why is no real title available?)
- scientific article; zbMATH DE number 2230941 (Why is no real title available?)
- scientific article; zbMATH DE number 3106184 (Why is no real title available?)
- Kernels by properly colored paths in arc-colored digraphs
- On (k,l)-perfectnees of Special Classes of Digraphs
- On 2-dominating kernels in graphs
- On (2-d)-kernels in the Cartesian product of graphs
- On \((k,l)\)-kernels in generalized products
- On \((k,l)\)-kernels in the Corona of digraphs
- On kernels by monochromatic paths in the corona of digraphs
- On minimum intersections of certain secondary dominating sets in graphs
- On proper (1,2)‐dominating sets in graphs
- On the complexity of the \(k\)-kernel problem on cyclically \(k\)-partite digraphs
- On the existence and the number of (2-d)-kernels in graphs.
- On the existence and the number of independent (1,2)-dominating sets in the \(G\)-join of graphs
- On the existence of \((k, l)\)-kernels in digraphs with a given circumference
- On the existence of \((k,l)\)-kernels in infinite digraphs: a survey
- Relations between packing and covering numbers of a tree
- Secondary domination in graphs
This page was built for publication: On the existence of independent \((1,k)\)-dominating sets for \(k\in\{1,2\}\) in two products of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7230464)
