Partition dimension and strong metric dimension of chain cycle

MaRDI QIDQ5151880zbMATH OpenFDO

Authors T. Ur Rehman, Naila Mehreen

Publication date 22 February 2021

Full work available at URL https://arxiv.org/abs/2007.09499, http://journals.yu.edu.jo/jjms/Issues/Vol13No22020PDF/9.pdf

zbMATH Keywords

chain cyclepartition dimensionstrong metric dimension

Mathematics Subject Classification ID

Distance in graphs (05C12) Connectivity (05C40) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Abstract: Let $G$ be a connected graph with vertex set $V(G)$ and edge set $E(G)$. For an ordered $k$-partition $Pi=Q_1,ldots,Q_k$ of $V(G)$, the representation of a vertex $vinV(G)$ with respect to $Pi$ is the $k$-vectors $r(v|Pi)=(d(v,Q_1),ldots,d(v,Q_k))$, where $d(v,Q_i)$ is the distance between $v$ and $Q_i$. The partition $Pi$ is a resolving partition if $r(u|Pi)eqr(v|Pi)$, for each pair of distinct vertices $u,vinV(G)$. The minimum $k$ for which there is a resolving $k$-partition of $V(G)$ is the partition dimension of $G$. A vertex $winV(G)$ strongly resolves two distinct vertices $u,vinV(G)$ if $u$ belongs to a shortest $v-w$ path or $v$ belongs to a shortest $u-w$ path. An ordered set $W=w_1,ldots,w_{t}subseteqV(G)$ is a strong resolving set for $G$ if for every two distinct vertices $u$ and $v$ of $G$ there exists a vertex $winW$ which strongly resolves $u$ and $v$. A strong metric basis of $G$ is a strong resolving set of minimal cardinality. The cardinality of a strong metric basis is called strong metric dimension of $G$. In this paper, we determine the partition dimension and strong metric dimension of a chain cycle constructed by even cycles and a chain cycle constructed by odd cycles.

Recommendations

• On partition dimension of some cycle-related graphs
• Further new results on strong resolving partitions for graphs
• On the strong partition dimension of graphs
• Connected partition dimensions of graphs
• Strong resolving partitions for strong product graphs and Cartesian product graphs

Cited in

(4)

• Further new results on strong resolving partitions for graphs
• scientific article; zbMATH DE number 5776159 (Why is no real title available?)
• On the strong partition dimension of graphs
• On partition dimension of some cycle-related graphs

This page was built for publication: Partition dimension and strong metric dimension of chain cycle

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5151880)