Complex networks are not easy to decode and understand to work on it, similarly, the
Möbius structure is also considered as a complex structure or geometry. But making a graph …

The production of low-cost, small in size, and high in efficiency objects is the topic of
research in almost all scientific fields, especially of engineering. In this scenario …

Let be a connected graph and for a given-ordered partition of vertices of a connected graph
is represented as. The representation of a vertex is the vector. The partition is a resolving …

Let ψ=(V, E) be a simple connected graph. The distance between ρ1, ρ2∈ V (ψ) is the
length of a shortest path between ρ1 and ρ2. Let Γ={Γ1, Γ2,..., Γj} be an ordered partition of …

Let G=(VG, EG) be the connected graph. For any vertex i∈ VG and a subset B⊆ VG, the
distance between i and B is d (i; B)= min {d (i, j)| j∈ B}. The ordered k‐partition of VG is …

Let G=(V, E) be a simple, connected graph with vertex set V (G) and E (G) edge set of G. For
two vertices a and b in a graph G, the distance d (a, b) from a to b is the length of shortest …

Finding the partition dimension of graph is still an open problem in the graph theory.
Therefore, several researchers investigate the problem in several operations of the graph …

Dimensi metrik merupakan konsep penting dalam teori graf yang banyak digunakan dalam
berbagai bidang, diataranya navigasi, lokalisasi jaringan, dan desain jaringan. Konsep …

The distance of a connected, simple graph P is denoted by d (α1, α2), which is the length of
a shortest path between the vertices α1, α2∈ V (P), where V (P) is the vertex set of P. The l …

To find the partition dimension, several researchers investigate the graph in various ways,
such as the graph operations or structure of the graph. In this paper, we use the subdivision …