arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1910.03038math.CO
收藏

超图的传染力控制

Infectious power domination of hypergraphs

Beth Bjorkman

摘要:

功率控制问题寻求找到监测电力网络所需的最小数量的传感器的位置。利用Bergen等人的感染规则将幂控制问题推广到超图:给定初始观测顶点集$S_0$,如果$A\subseteq e$和对于任何未观测顶点$v$,如果$A\cup \{v\}$包含在边中,则$v\in e$,则集合$A\subseteq S_0$可以感染边$e$.我们将控制步骤与该感染规则相结合以创建\emph{infectious power domination}。我们比较这个新的参数,以前的推广张和Chantesel。我们提供了一般的界限,并确定一些超图操作的影响。

英文摘要:

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 initial set of observed vertices, $S_0$, a set $A\subseteq S_0$ may infect an edge $e$ if $A\subseteq e$ and for any unobserved vertex $v$, if $A\cup \{v\}$ is contained in an edge, then $v\in 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.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑