arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2103.07972cs.DM
收藏

开放独立、开放定位支配集:若干图类的结构方面

Open-independent, open-locating-dominating sets: structural aspects of some classes of graphs

Márcia R. Cappelle, Erika Coelho, Les R. Foulds, Humberto J. Longo

AI总结:

本文研究开放独立开放定位支配集(OLD_oind-集)的存在性判定问题,证明其在平面二分图和平面次三次图中仍为NP-完全,并刻画了P_4-tidy图与余图互补棱镜具有该集合的结构特征。

摘要:

设$G=(V(G),E(G))$是一个有限简单无向图,其中$V(G)$为顶点集,$E(G)$为边集,$S\subseteq V(G)$为顶点子集。若$G$的每个顶点在$S$中至少有一个邻居,则称$S$为开放支配集;若$G$中任意两个顶点在$S$中的邻居集合不相同,且$S$中每个顶点恰好被$S$开放支配一次,则称$S$为开放独立、开放定位支配集(简称$OLD_{oind}$-集)。判定$G$是否具有$OLD_{oind}$-集的问题具有重要的应用,这些应用已在其他地方报道。由于该问题已知是$\mathcal{NP}$-完全的,它似乎非常困难,因为我们证明即使对于最大度为五、围长为六的平面二分图,以及围长为九的平面次三次图,其复杂性仍然相同。此外,我们给出了具有$OLD_{oind}$-集的$P_4$-tidy图以及余图的互补棱镜的特征刻画。

英文摘要:

Let $G=(V(G),E(G))$ be a finite simple undirected graph with vertex set $V(G)$, edge set $E(G)$ and vertex subset $S\subseteq V(G)$. $S$ is termed \emph{open-dominating} if every vertex of $G$ has at least one neighbor in $S$, and \emph{open-independent, open-locating-dominating} (an $OLD_{oind}$-set for short) if no two vertices in $G$ have the same set of neighbors in $S$, and each vertex in $S$ is open-dominated exactly once by $S$. The problem of deciding whether or not $G$ has an $OLD_{oind}$-set has important applications that have been reported elsewhere. As the problem is known to be $\mathcal{NP}$-complete, it appears to be notoriously difficult as we show that its complexity remains the same even for just planar bipartite graphs of maximum degree five and girth six, and also for planar subcubic graphs of girth nine. Also, we present characterizations of both $P_4$-tidy graphs and the complementary prisms of cographs that have an $OLD_{oind}$-set.

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

↑