Raza Hassan, Iqbal Naveed, Khan Hamda, Botmart Thongchai
Business School, 47863University of Shanghai for Science and Technology, Shanghai, China.
Department of Mathematics, Faculty of Science, University of Ha'il, Saudia Arabia.
Sci Prog. 2021 Oct;104(4):368504211053417. doi: 10.1177/00368504211053417.
Let be a connected graph. A locating-total dominating set in a graph is a total dominating set of a , for every pair of vertices , such that . The minimum cardinality of a locating-total dominating set is called locating-total domination number and represented as . In this paper, locating-total domination number is determined for some cycle-related graphs. Furthermore, some well-known graphs of convex polytopes from the literature are also considered for the locating-total domination number.
设(G)为一个连通图。图(G)中的一个定位全支配集是(G)的一个全支配集(S)，对于每一对顶点(u, v \in V(G))，使得(N(u) \cap S \neq N(v) \cap S)。定位全支配集的最小基数称为定位全支配数，记为(\gamma_{lt}(G))。在本文中，确定了一些与圈相关的图的定位全支配数。此外，还考虑了文献中一些著名的凸多面体图的定位全支配数。
Zotero 插件
