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

图的弱全可解集

Weak total resolving sets in graphs

Imran Javaid, Muhammad Salman, Mahr Murtaza, Farheen Iftikhar, Muhammad Imran

摘要:

$G$的顶点的集合$W$被称为$G$的弱全分解集,如果$W$是$G$的分解集,并且对于每个$w\in W$,$W-\{w\}$中至少有一个元素为每个$v\in V(G)- W$分解$w$和$v$。$G$的弱全度量维数是$G$的弱全分解集的最小阶.本文研究了树的弱全度量维数。定义了图的弱全可分解数和随机弱全$k$维图,并对它们进行了研究。给出了弱全分解数和弱全度量维数的一些刻画和实现。

英文摘要:

A set $W$ of vertices of $G$ is said to be a weak total resolving set for $G$ if $W$ is a resolving set for $G$ as well as for each $w\in W$, there is at least one element in $W-\{w\}$ that resolves $w$ and $v$ for every $v\in V(G)- W$. Weak total metric dimension of $G$ is the smallest order of a weak total resolving set for $G$. This paper includes the investigation of weak total metric dimension of trees. Also, weak total resolving number of a graph as well as randomly weak total $k$-dimensional graphs are defined and studied in this paper. Moreover, some characterizations and realizations regarding weak total resolving number and weak total metric dimension are given.

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

↑