On the metric basis in wheels with consecutive missing spokes

On the metric basis in wheels with consecutive missing spokes

If $G$ is a connected graph, the $distance$ $d(u, v)$ between two vertices $u, v \in V(G)$ is the length of a shortest path between them. Let $W = \{w_1,w_2, \dots ,w_k\}$ be an ordered set of vertices of $G$ and let $v$ be a vertex of $G$. The $representation$ $r(v|W)$ of $v$ with respect to $W$ is...

Full description

Bibliographic Details
Main Authors: Syed Ahtsham Ul Haq Bokhary, Zill-e-Shams, Abdul Ghaffar, Kottakkaran Sooppy Nisar
Format: Article
Language:English
Published: AIMS Press 2020-08-01
Series:AIMS Mathematics
Subjects:
metric dimension
basis
resolving set
wheel
missing spokes
exchange property
Online Access:https://www.aimspress.com/article/10.3934/math.2020400/fulltext.html

Internet

https://www.aimspress.com/article/10.3934/math.2020400/fulltext.html

Similar Items