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

图中监控边测地集的界与极值图

Bounds and extremal graphs for monitoring edge-geodetic sets in graphs

Florent Foucaud, Clara Marcille, Zin Mar Myint, R. B. Sandeep, Sagnik Sen, S. Taruni

AI总结:

本文研究监控边测地数,比较其与其他参数,刻画最小MEG-集为全顶点集的图,给出稀疏图上界,并分析团和与细分操作下的变化界。

摘要:

图 $G$ 的监控边测地集(简称 MEG-集)是一个顶点子集 $M \subseteq V(G)$,使得对于 $G$ 的任意边 $e$,存在 $u,v \in M$,$e$ 位于 $G$ 的某条最短 $u$-$v$ 路径上。图 $G$ 的监控边测地数,记为 $meg(G)$,是这种 MEG-集的最小基数。这一概念为网络监控问题提供了图论模型。在本文中,我们将 $meg(G)$ 与源自网络监控问题的其他图论参数进行比较,并给出具有这些参数规定值的图例。我们还刻画了以 $V(G)$ 作为其最小 MEG-集的图 $G$,这解决了 Foucaud 等人(CALDAM 2023)提出的一个开放问题,并证明某些图类属于这一刻画。我们还为稀疏图提供了 $meg(G)$ 的一个一般上界,该上界用图的围长表示,随后利用 $G$ 的色数对上界进行改进。我们考察了 $meg(G)$ 相对于两个基本图操作(团和与细分)的变化。在这两种情况下,我们给出了可能变化量的下界和上界,并提供了(几乎)紧的例子。

英文摘要:

A monitoring edge-geodetic set, or simply an MEG-set, of a graph $G$ is a vertex subset $M \subseteq V(G)$ such that given any edge $e$ of $G$, $e$ lies on every shortest $u$-$v$ path of $G$, for some $u,v \in M$. The monitoring edge-geodetic number of $G$, denoted by $meg(G)$, is the minimum cardinality of such an MEG-set. This notion provides a graph theoretic model of the network monitoring problem. In this article, we compare $meg(G)$ with some other graph theoretic parameters stemming from the network monitoring problem and provide examples of graphs having prescribed values for each of these parameters. We also characterize graphs $G$ that have $V(G)$ as their minimum MEG-set, which settles an open problem due to Foucaud \textit{et al.} (CALDAM 2023), and prove that some classes of graphs fall within this characterization. We also provide a general upper bound for $meg(G)$ for sparse graphs in terms of their girth, and later refine the upper bound using the chromatic number of $G$. We examine the change in $meg(G)$ with respect to two fundamental graph operations: clique-sum and subdivisions. In both cases, we provide a lower and an upper bound of the possible amount of changes and provide (almost) tight examples.

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

↑