ترغب بنشر مسار تعليمي؟ اضغط هنا

Power domination on triangular grids

127   0   0.0 ( 0 )
 نشر من قبل Claire Pennarun
 تاريخ النشر 2017
  مجال البحث الهندسة المعلوماتية
والبحث باللغة English




اسأل ChatGPT حول البحث

The concept of power domination emerged from the problem of monitoring electrical systems. Given a graph G and a set S $subseteq$ V (G), a set M of monitored vertices is built as follows: at first, M contains only the vertices of S and their direct neighbors, and then each time a vertex in M has exactly one neighbor not in M, this neighbor is added to M. The power domination number of a graph G is the minimum size of a set S such that this process ends up with the set M containing every vertex of G. We here show that the power domination number of a triangular grid T_k with hexagonal-shape border of length k -- 1 is exactly $lceil k/3 rceil.



قيم البحث

اقرأ أيضاً

123 - Paul Dorbec 2017
Power domination in graphs emerged from the problem of monitoring an electrical system by placing as few measurement devices in the system as possible. It corresponds to a variant of domination that includes the possibility of propagation. For measur ement devices placed on a set S of vertices of a graph G, the set of monitored vertices is initially the set S together with all its neighbors. Then iteratively, whenever some monitored vertex v has a single neighbor u not yet monitored, u gets monitored. A set S is said to be a power dominating set of the graph G if all vertices of G eventually are monitored. The power domination number of a graph is the minimum size of a power dominating set. In this paper, we prove that any maximal planar graph of order n $ge$ 6 admits a power dominating set of size at most (n--2)/4 .
The domination number of a graph $G = (V,E)$ is the minimum cardinality of any subset $S subset V$ such that every vertex in $V$ is in $S$ or adjacent to an element of $S$. Finding the domination numbers of $m$ by $n$ grids was an open problem for ne arly 30 years and was finally solved in 2011 by Goncalves, Pinlou, Rao, and Thomasse. Many variants of domination number on graphs have been defined and studied, but exact values have not yet been obtained for grids. We will define a family of domination theories parameterized by pairs of positive integers $(t,r)$ where $1 leq r leq t$ which generalize domination and distance domination theories for graphs. We call these domination numbers the $(t,r)$ broadcast domination numbers. We give the exact values of $(t,r)$ broadcast domination numbers for small grids, and we identify upper bounds for the $(t,r)$ broadcast domination numbers for large grids and conjecture that these bounds are tight for sufficiently large grids.
A vertex subset $S$ of a graph $G=(V,E)$ is a $[1,2]$-dominating set if each vertex of $Vbackslash S$ is adjacent to either one or two vertices in $S$. The minimum cardinality of a $[1,2]$-dominating set of $G$, denoted by $gamma_{[1,2]}(G)$, is call ed the $[1,2]$-domination number of $G$. In this paper the $[1,2]$-domination and the $[1,2]$-total domination numbers of the generalized Petersen graphs $P(n,2)$ are determined.
112 - Beth Bjorkman 2019
The power domination problem seeks to find the placement of the minimum number of sensors needed to monitor an electric power network. We generalize the power domination problem to hypergraphs using the infection rule from Bergen et al: given an init ial set of observed vertices, $S_0$, a set $Asubseteq S_0$ may infect an edge $e$ if $Asubseteq e$ and for any unobserved vertex $v$, if $Acup {v}$ is contained in an edge, then $vin e$. We combine a domination step with this infection rule to create emph{infectious power domination}. We compare this new parameter to the previous generalization by Chang and Roussel. We provide general bounds and determine the impact of some hypergraph operations.
In this paper we continue the study of the edge intersection graphs of one (or zero) bend paths on a rectangular grid. That is, the edge intersection graphs where each vertex is represented by one of the following shapes: $llcorner$,$ulcorner$, $urco rner$, $lrcorner$, and we consider zero bend paths (i.e., | and $-$) to be degenerate $llcorner$s. These graphs, called $B_1$-EPG graphs, were first introduced by Golumbic et al (2009). We consider the natural subclasses of $B_1$-EPG formed by the subsets of the four single bend shapes (i.e., {$llcorner$}, {$llcorner$,$ulcorner$}, {$llcorner$,$urcorner$}, and {$llcorner$,$ulcorner$,$urcorner$}) and we denote the classes by [$llcorner$], [$llcorner$,$ulcorner$], [$llcorner$,$urcorner$], and [$llcorner$,$ulcorner$,$urcorner$] respectively. Note: all other subsets are isomorphic to these up to 90 degree rotation. We show that testing for membership in each of these classes is NP-complete and observe the expected strict inclusions and incomparability (i.e., [$llcorner$] $subsetneq$ [$llcorner$,$ulcorner$], [$llcorner$,$urcorner$] $subsetneq$ [$llcorner$,$ulcorner$,$urcorner$] $subsetneq$ $B_1$-EPG; also, [$llcorner$,$ulcorner$] is incomparable with [$llcorner$,$urcorner$]). Additionally, we give characterizations and polytime recognition algorithms for special subclasses of Split $cap$ [$llcorner$].
التعليقات
جاري جلب التعليقات جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
mircosoft-partner

هل ترغب بارسال اشعارات عن اخر التحديثات في شمرا-اكاديميا