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

关于模积图的距离与强度量维数

On Distance and Strong Metric Dimension of the Modular Product

Cong X. Kang, Aleksander Kelenc, Iztok Peterin, Eunjeong Yi

AI总结:

本文研究模积图的距离与强度量维数,推导距离公式并刻画强分辨图,进而计算若干无限图族的强度量维数。

摘要:

图$G$和$H$的模积$G\diamond H$是一个顶点集为$V(G)\times V(H)$的图。$G\diamond H$中两个顶点$(g,h)$和$(g',h')$相邻,如果$g=g'$且$hh'\in E(H)$,或$gg'\in E(G)$且$h=h'$,或$gg'\in E(G)$且$hh'\in E(H)$,或(当$g\neq g'$且$h\neq h'$时)$gg'\notin E(G)$且$hh'\notin E(H)$。我们推导了模积的距离公式,然后描述了$G\diamond H$的强分辨图的所有边。这随后被用于获得若干无限图族上模积的强度量维数。

英文摘要:

The modular product $G\diamond H$ of graphs $G$ and $H$ is a graph on vertex set $V(G)\times V(H)$. Two vertices $(g,h)$ and $(g',h')$ of $G\diamond H$ are adjacent if $g=g'$ and $hh'\in E(H)$, or $gg'\in E(G)$ and $h=h'$, or $gg'\in E(G)$ and $hh'\in E(H)$, or (for $g\neq g'$ and $h\neq h'$) $gg'\notin E(G)$ and $hh'\notin E(H)$. We derive the distance formula for the modular product and then describe all edges of the strong resolving graph of $G\diamond H$. This is then used to obtain the strong metric dimension of the modular product on several, infinite families of graphs.

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

↑