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

冠积图的$k$ -度量维数

The $k$-metric dimension of corona product graphs

Alejandro Estrada-Moreno, Ismael Gonzalez Yero, Juan Alberto Rodriguez-Velazquez

摘要:

给定一个连通简单图$G=(V,E)$和一个正整数$k$,一个集合$S\subseteq V$称为$G$的$k$ -度量生成元当且仅当对于任何一对不同的顶点$u,v\in V$,至少存在$k$顶点$w_1,w_2,...,w_k\in S$,使得对于每个$i\in \{1,...,k\}$,$d_G(u,w_i)\ne d_G(v,w_i)$,其中$d_G(x,y)$是$x$和$y$之间的最短路径的长度。$G$中最小基数的$k$ -度量生成元称为$k$ -度量基,其基数称为$G$的$k$ -度量维数。本文研究了冠积图$G\odot\mathcal{H}$的$k$ -度量维数,其中$G$是$n$阶图,$\mathcal{H}$是一族$n$非平凡图.具体地说,我们给出了连通冠图中$k$ -度量基存在的一些充分必要条件。此外,我们还得到了连通冠图的$k$ -度量维数的紧界和封闭公式。

英文摘要:

Given a connected simple graph $G=(V,E)$, and a positive integer $k$, a set $S\subseteq V$ is said to be a $k$-metric generator for $G$ if and only if for any pair of different vertices $u,v\in V$, there exist at least $k$ vertices $w_1,w_2,...,w_k\in S$ such that $d_G(u,w_i)\ne d_G(v,w_i)$, for every $i\in \{1,...,k\}$, where $d_G(x,y)$ is the length of a shortest path between $x$ and $y$. A $k$-metric generator of minimum cardinality in $G$ is called a $k$-metric basis and its cardinality, the $k$-metric dimension of $G$. In this article we study the $k$-metric dimension of corona product graphs $G\odot\mathcal{H}$, where $G$ is a graph of order $n$ and $\mathcal{H}$ is a family of $n$ non-trivial graphs. Specifically, we give some necessary and sufficient conditions for the existence of a $k$-metric basis in a connected corona graph. Moreover, we obtain tight bounds and closed formulae for the $k$-metric dimension of connected corona graphs.

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

↑