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

计算图的$k$ -度量维数的一些二元积和整数线性规划

Some binary products and integer linear programming for computing $k$-metric dimension of graphs

Sandi Klavžar, Freydoon Rahbarnia, Mostafa Tavakoli

摘要:

设$G$是一个连通图.对于有序集$S=\{v_1,\ldots, v_\ell\}\subseteq V(G)$,向量$r_G(v|S) = (d_G(v_1,v), \ldots, d_G(v_\ell,v))$称为度量$S$ -$v$的表示。如果对于任何一对不同的顶点$u,v\in V(G)$,矢量$r(v|S)$和$r(u|S)$至少在$k$位置上不同,则$S$是$G$的$k$度量生成器。用于$G$的最小$k$度量生成器是用于$G$的$k$ -{ \em度量基},其基数是$G$的$k$度量维度.证明了图的层次积的$k$ -度量维数的一个精确上界和一个封闭公式。此外,尖锐的下界$k$度量维数的拼接和链接产品的图。提出了一个计算给定图的$k$ -度量维数和$k$ -度量基的整数线性规划模型.这些结果被应用到绑定或计算$k$度量维数的某些类的图,在数学化学的兴趣。

英文摘要:

Let $G$ be a connected graph. For an ordered set $S=\{v_1,\ldots, v_\ell\}\subseteq V(G)$, the vector $r_G(v|S) = (d_G(v_1,v), \ldots, d_G(v_\ell,v))$ is called the metric $S$-representation of $v$. If for any pair of different vertices $u,v\in V(G)$, the vectors $r(v|S)$ and $r(u|S)$ differ in at least $k$ positions, then $S$ is a $k$-metric generator for $G$. A smallest $k$-metric generator for $G$ is a $k$-{\em metric basis} for $G$, its cardinality being the $k$-metric dimension of $G$. A sharp upper bound and a closed formulae for the $k$-metric dimension of the hierarchical product of graphs is proved. Also, sharp lower bounds for the $k$-metric dimension of the splice and link products of graphs are presented. An integer linear programming model for computing the $k$-metric dimension and a $k$-metric basis of a given graph is proposed. These results are applied to bound or to compute the $k$-metric dimension of some classes of graphs that are of interest in mathematical chemistry.

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

↑