On Vertex-Edge Resolvability for the Web Graph and Prism Related Graph

Sharma, Sunny; Bhat, Vijay

doi:10.61091/ars157-10

Abstract

References

Ars Combinatoria

Volume 157
Pages: 95-108

Research article

On Vertex-Edge Resolvability for the Web Graph and Prism Related Graph

^¹, ^²

¹Department of Mathematics, Manipal Institute of Technology Bengaluru, Manipal Academy of Higher Education, Manipal, Karnataka, India.

²School of Mathematics, Shri Mata Vaishno Devi University, Katra-182320, India.

Received: 15/12/2023
Accepted: 21/12/2023
Published: 25/12/2023

Copyright Link
License

Abstract

Let $E (H)$ and $V (H)$ denote the edge set and the vertex set of the simple connected graph $H$ , respectively. The mixed metric dimension of the graph $H$ is the graph invariant, which is the mixture of two important graph parameters, the edge metric dimension and the metric dimension. In this article, we compute the mixed metric dimension for the two families of the plane graphs viz., the Web graph $W_{n}$ and the Prism allied graph $D_{n}^{t}$ . We show that the mixed metric dimension is non-constant unbounded for these two families of the plane graph. Moreover, for the Web graph $W_{n}$ and the Prism allied graph $D_{n}^{t}$ , we unveil that the mixed metric basis set $M_{G}^{m}$ is independent.

Keywords: Metric dimension, Mixed metric dimension, Independent resolving set, Connected graph

1. Introduction

The graph invariant $m e t r i c$ $d i m e n s i o n$ is among the important and highly active research topic in Graph Theory. This fundamental concept of metric dimension was founded by two groups of researchers independently viz., Slater in [1] and Harary and Melter in [2], in the late seventies. The set $M_{G}$ of points in the taken metric space with the property (or characteristic) that any point of the space is determined uniquely by its distances from the points of $M_{G}$ , is referred to as the $g e n e r a t o r$ (or $m e t r i c$ $g e n e r a t o r$ ) of the given metric space. These metric generating sets are called the locating sets by Slater in [1] and the resolving sets by Melter and Harary in [2], respectively.

After these two important initial papers [1,2], several works regarding theoretical properties, as well as applications, of this graph invariant were published. Initially, Slater considered special acknowledgment of a thief in the network, while others noticed problems in picture preparing (or image processing) and design acknowledgment (or pattern recognition) [3], applications to science are given in [4], to the route of exploring specialist (navigating agent or robots) in systems (or networks) are examined in [5], to issues of check and system revelation (or network discovery) in [6], application to combinatorial enhancement (or optimization) is yielded in [7], and for more work see [8,9,10].

Suppose $E (H)$ and $V (H)$ denote the edge set and the vertex set of the simple connected graph $H$ , respectively. The distance between two vertices $α, β \in V (H)$ , is denoted and defined as $d_{H} (α, β) =$ length of the shortest possible $α - β$ path in $H$ and the $d_{H} (α, ε) = m i n {d_{H} (α, β_{1}), d_{H} (α, β_{2})}$ represents the distance between an edge $ε = β_{1} β_{2}$ and the vertex $α$ in $H$ . If the distance between the vertex $α$ and an element $β$ is not equaled to the distance between the same vertex $α$ and an element $γ$ in $H$ (where $β, γ \in V (H) \cup E (H)$ ), then one can say that the vertex $α$ distinguish (determines or resolves) two elements $β$ and $γ$ in $H$ .

A set $M_{G}$ consisting of the vertices of the graph $H$ , is termed as the $m e t r i c$ $g e n e r a t o r$ for $H$ , if the vertices of $M_{G}$ distinguish (determines or resolves) every pair of different vertices of the connected graph $H$ . These metric generators are called $m e t r i c$ $b a s i s$ for $H$ if it has the minimum cardinality and this cardinal number of the metric basis is referred to as the $m e t r i c$ $d i m e n s i o n$ of the graph $H$ , denoted by $β (H)$ or $d i m (H)$ .

On the other hand, concerning the hypothetical examinations of this important topic, various perspectives of metric generators $M_{G}$ have been depicted in the recent literature, which has profoundly added to acquire more understanding into numerical properties of this graph invariant related with distances in networks. Several authors working on this topic have presented different varieties of metric generators like for example, independent resolving sets, resolving dominating sets, strong resolving sets, local metric sets, edge resolving sets, strong resolving partitions, mixed metric sets, etc. For these see references in [8,10,11,12,13]. A set $L$ consisting of vertices of the graph $H$ is said to be an independent resolving set for $H$ , if $L$ is both resolving (metric generator) and independent.

One can see that the metric dimension deals with the vertices of the graph by its definition, a similar concept dealing with the edges of the graph introduced by Kelenc et al. in [11], called the edge metric dimension of the graph $H$ , which uniquely identifies the edges related to a graph $H$ . For an edge $ε = β_{1} β_{2}$ and a vertex $x$ the distance between them is defined as $d_{H} (x, ε) = m i n {d_{H} (x, β_{1}), d_{H} (x, β_{2})}$ . A subset $M_{G}^{ε}$ is called an edge metric generator for $H$ , if any two different edges of $H$ are distinguish by some vertex of $M_{G}^{ε}$ . The edge metric generator with minimum cardinality is termed as edge metric basis and that cardinality is known as the edge metric dimension of the graph $H$ , and which is denoted by $e d i m (H)$ or $β_{E} (H)$ . A set $L_{E}$ consisting of vertices of the graph $H$ is said to be an independent edge metric generator for $H$ , if $L_{E}$ is both edge metric generator and independent.

2. Mixed metric dimension:

Recently, a new kind of graph parameter was introduced by Kelenc et al. in [12], which is the composition of both, the edge metric dimension and the metric dimension and called the mixed metric dimension for a graph $H$ . A subset $M_{G}^{m}$ is called a mixed metric generator for $H$ , if any two different elements of $V (H) \cup E (H)$ are distinguished by some vertex of $M_{G}^{m}$ . For an ordered subset $L_{M} = {ζ_{1}, ζ_{2}, ζ_{3}, \dots, ζ_{p}}$ of vertices of the graph $H$ , and an element $y \in V (H) \cup E (H)$ , the mixed metric code $∖$ mixed metric representation of $y$ regarding $M_{G}^{m}$ is the ordered $p$ -tuple $ζ_{M} (y | M_{G}^{m}) = (d_{H} (y, ζ_{1}), d_{H} (y, ζ_{2}), d_{H} (y, ζ_{3}), \dots, d_{H} (y, ζ_{p}))$ .

If for any two distinct elements $y_{1}$ and $y_{2}$ of $V (H) \cup E (H)$ , $ζ_{M} (y_{1} | M_{G}^{m}) \neq ζ_{M} (y_{2} | M_{G}^{m})$ , then $M_{G}^{m}$ is said to be a mixed metric generator (or shortly, MMG) for $H$ . The mixed metric generator with minimum cardinality is termed as the mixed metric basis, and that cardinality is known as the mixed metric dimension of the graph $H$ , and which is denoted by $m d i m (H)$ or $β_{M} (H)$ . For our gentle purpose, by MMG and MMD we denote mixed metric generator and mixed metric dimension, respectively. Now, like edge metric dimension and the metric dimension, for this graph invariant one can define that, set $L_{M}$ consisting of vertices of the graph, $H$ is said to be an independent mixed metric generator for $H$ , if $L_{M}$ is both a MMG and independent.

In this study, we consider two important families of the plane graphs viz., the prism allied graph $D_{n}^{t}$ ([15], see Figure 1) and the Web graph $W_{n}$ ([16], see Figure 2) and we obtain their MMD. Recently, the metric dimension and the edge metric dimension of these two families of the plane graphs were computed. For the metric dimension of these families of plane graphs we have the following results:

Theorem 1. [15] Let $D_{n}^{t}$ be the Prism allied graph on $6 n$ edges and $4 n$ vertices. Then, for $n \geq 6$ , we have $β (D_{n}^{t}) = 3$ .

Theorem 2. [16] Let $W_{n}$ be the Web graph on $4 n$ edges and $3 n$ vertices. Then, for $n \geq 3$ , we have

$\begin{aligned} β (W_{n}) = {\begin{cases} 2, & i f n i s o d d; \\ 3, & o t h e r w i s e \end{cases} \end{aligned}$

and regarding the edge metric dimension, we have

Theorem 3. [15] Let $D_{n}^{t}$ be the Prism allied graph on $6 n$ edges and $4 n$ vertices. Then, for $n \geq 3$ , we have $\begin{aligned} β_{E} (D_{n}^{t}) = {\begin{cases} 4, & i f n = 3, 4,; \\ ⌈ \frac{n}{2} ⌉ + 1, & o t h e r w i s e . \end{cases} \end{aligned}$

Theorem 4. [16] Let $W_{n}$ be the Web graph on $4 n$ edges and $3 n$ vertices. Then, for $n \geq 3$ , we have $β_{E} (W_{n}) = 3$ .

Throughout this article, all vertex indices are taken to be modulo $n$ . The present paper is organized as follows:

In section 2, we study the MMD of the Prism allied graph $D_{n}^{t}$ , when the MMG $M_{G}^{m}$ is independent (see Figure 1). In section 3, we study the MMD of the Web graph $W_{n}$ , when the MMG $M_{G}^{m}$ is independent (see Figure 2), and in our last section, we conclude our results and findings regarding these two important families of the plane graphs.

3. Mixed Resolvability of the Prism Allied Graph $D_{n}^{t}$

The Prism allied graph $D_{n}^{t}$ [15] has vertex set of cardinality $4 n$ and an edge set of cardinality $6 n$ , indicated by $V (D_{n}^{t})$ and $E (D_{n}^{t})$ respectively, where $V (D_{n}^{t}) = {p_{η}, q_{η}, r_{η}, s_{η} | 1 \leq η \leq n}$ and $E (D_{n}^{t}) = {p_{η} q_{η}, p_{η} p_{η + 1}, q_{η} q_{η + 1}, r_{η} q_{η}, r_{η} q_{η + 1}, r_{η} s_{η} | 1 \leq η \leq n}$ . It comprises of $n$ $3$ -sided faces, $n$ pendant edges, $n$ $4$ -sided faces, and an $n$ -sided face (see Figure 1). The graph $D_{n}^{t}$ is allied to the Prism graph $D_{n}$ in the sense that, it can be acquired from the Prism graph by including new vertices ${r_{η}, s_{η} | 1 \leq η \leq n}$ and edges ${r_{η} q_{η}, r_{η} q_{η + 1}, r_{η} s_{η} | 1 \leq η \leq n}$ in $D_{n}$ as follows:

Placing new vertices $r_{η}$ , between the edges $q_{η} q_{η + 1}$ $(1 \leq η \leq n)$ .
Again join the vertices $q_{η}$ and $q_{η + 1}$ .
Join the vertices $r_{η}$ and $s_{η}$ , in order to obtain the $n$ pendant edges.

Figure 1. The Prism Allied Graph $D_{n}^{t}$ , for $n \geq 4$ .

For our smooth purpose, we refer to the cycle brought forth by the arrangement of vertices ${q_{η} : 1 ⩽ η ⩽ n}$ and ${p_{η} : 1 ⩽ η ⩽ n}$ in the graph, $D_{n}^{t}$ as the $q$ and $p$ -cycle respectively, the arrangement of vertices ${r_{η} : 1 ⩽ η ⩽ n}$ and ${s_{η} : 1 ⩽ η ⩽ n}$ , in the graph, $D_{n}^{t}$ as the set of outer and pendant vertices respectively. For our convenience, we consider $s_{1} = s_{n + 1}$ , $r_{1} = r_{n + 1}$ , $q_{1} = q_{n + 1}$ , and $p_{1} = p_{n + 1}$ . In the present working section, we obtain that the least possible cardinality for the MMG $M_{G}^{m}$ of the Prism allied graph $D_{n}^{t}$ is $n + 1$ . We also find that the MMG $M_{G}^{m}$ for the Prism allied graph $D_{n}^{t}$ is independent. Now, in order to get the exact MMD of graph $D_{n}^{t}$ , we need the following three Lemmas:

Lemma 1. The set of outer vertices ${s_{η} | 1 \leq η \leq n} \subset M_{G}^{m}$ , where $M_{G}^{m}$ is a MMG for the Prism allied graph $D_{n}^{t}$ .

Proof. For the inconsistency, we suppose that the MMG $M_{G}^{m}$ , does not contain at least one vertex from the set ${s_{η} | 1 \leq η \leq n}$ . Without loss of generality, we suppose that $s_{η} \notin M_{G}^{m}$ , for any $η$ . At that point, we have $ℑ_{M} (r_{η} | M_{G}^{m}) = ℑ_{M} (r_{η} s_{η} | M_{G}^{m})$ , $ℑ_{M} (q_{η} | M_{G}^{m}) = ℑ_{M} (r_{η} q_{η} | M_{G}^{m})$ , and $ℑ_{M} (q_{η + 1} | M_{G}^{m}) = ℑ_{M} (r_{η} q_{η + 1} | M_{G}^{m})$ , a contradiction.

Lemma 2. Let $P = {p_{η} | 1 \leq η \leq n}$ and $M_{G}^{m}$ be any mixed resolving generator for the Prism allied graph $D_{n}^{t}$ . Then, $P \cap M_{G}^{m} \neq \emptyset$ .

Proof. Suppose on the contrary that $P \cap M_{G}^{m} = \emptyset$ i.e., for any $η$ , $p_{η} \notin M_{G}^{m}$ . Then, we have $ℑ_{M} (q_{η} | M_{G}^{m}) = ℑ_{M} (p_{η} q_{η} | M_{G}^{m})$ , a contradiction.

In the accompanying Lemma, we show that the cardinality of any mixed resolving generator for the Prism allied graph $D_{n}^{t}$ is greater than or equals to $n + 1$ i.e., $| M_{G}^{m} | \geq n + 1$ .

Lemma 3. For the Prism allied graph $D_{n}^{t}$ and $n \geq 4$ , we have $m d i m (D_{n}^{t}) \geq n + 1$ .

Proof. On contrary, we suppose that the cardinality of the mixed resolving generator $M_{G}^{m}$ of the Prism allied graph $D_{n}^{t}$ is equals to $n$ i.e., $β_{M} (D_{n}^{t}) = n$ . Then, on combining Lemma 1 and 2, we get contradiction as the cardinality of the set ${s_{η} | 1 \leq η \leq n}$ is $n$ . So, we must have $β_{M} (D_{n}^{t}) \geq n + 1$ .

Now, we are ready to obtain the exact mixed metric dimension for the Prism allied graph $D_{n}^{t}$ . For this, we have the following important result:

Theorem 5. For the Prism allied graph $D_{n}^{t}$ , we have $m d i m (D_{n}^{t}) = n + 1$ , $\forall$ $n \geq 4$ .

Proof. By Lemma 3, we have $m d i m (D_{n}^{t}) \geq n + 1$ . Now, in order to complete the proof of the theorem, we have to show that $m d i m (D_{n}^{t}) \leq n + 1$ . For this, suppose $M_{G}^{m} = {p_{1}, s_{1}, s_{2}, \dots, s_{n - 1}, s_{n}} \subset V (D_{n}^{t})$ (for the location of these vertices, see Figure 1 (vertices in green color)). We will show that $M_{G}^{m}$ is the MMG for the Prism allied graph $D_{n}^{t}$ . By total enumeration, it can be easily checked that the set $M_{G}^{m}$ is the MMG for the Prism allied graph $D_{n}^{t}$ , when $n = 4, 5$ . Now, for $n \geq 6$ , we consider the following two cases regarding the positive integer $n$ (i.e., when $n \equiv 0 (m o d n)$ and $n \equiv 1 (m o d 2)$ ).

Case-1 $n \equiv 0 (m o d 2)$ .
In this case, $n$ can be written as $n = 2 α$ , where $α \in N$ and $α \geq 3$ . Let $M_{G}^{*} = {p_{1}, s_{1}, s_{2}, s_{α + 1}, s_{α + 2}} \subset V (D_{n}^{t})$ . Now, to figure out that $M_{G}^{*}$ is the MMG for the Prism allied graph $D_{n}^{t}$ , we consign the mixed metric codes for each vertex and each edge of the graph $D_{n}^{t}$ regarding $M_{G}^{*}$ ( $b = α$ in Figures 1 and 2).
Now, the mixed metric codes for the vertices ${υ = p_{η}, q_{η}, r_{η}, s_{η} | η = 1, 2, 3, \dots, n}$ regarding the set $M_{G}^{*}$ are shown below in the following four tables respectively.

$ℑ_{M} (υ \| M_{G}^{*})$	$M_{G}^{*} = {p_{1}, s_{1}, s_{2}, s_{α + 1}, s_{α + 2}}$
$ℑ_{M} (p_{η} \| M_{G}^{*})$ :( $η = 1$ )	$(η - 1, 3, 4, α + 2, α + 1)$
$ℑ_{M} (p_{η} \| M_{G}^{*})$ :( $η = 2$ )	$(η - 1, η + 1, 3, α - η + 4, α + 2)$
$ℑ_{M} (p_{η} \| M_{G}^{*})$ :( $3 \leq η \leq α + 1$ )	$(η - 1, η + 1, η, α - η + 4, α - η + 5)$
$ℑ_{M} (p_{η} \| M_{G}^{*})$ :( $η = α + 2$ )	$(2 α - η + 1, 2 α - η + 4, η, η - α + 1, α - η + 5)$
$ℑ_{M} (p_{η} \| M_{G}^{*})$ :( $α + 3 \leq η \leq 2 α$ )	$(2 α - η + 1, 2 α - η + 4, 2 α - η + 5, η - α + 1, η - α)$

$ℑ_{M} (υ \| M_{G}^{*})$	$M_{G}^{*} = {p_{1}, s_{1}, s_{2}, s_{α + 1}, s_{α + 2}}$
$ℑ_{M} (q_{η} \| M_{G}^{*})$ :( $η = 1$ )	$(η, 2, 3, α + 1, α)$
$ℑ_{M} (q_{η} \| M_{G}^{*})$ :( $η = 2$ )	$(η, η, 2, α - η + 3, α + 1)$
$ℑ_{M} (q_{η} \| M_{G}^{*})$ :( $3 \leq η \leq α + 1$ )	$(η, η, η - 1, α - η + 3, α - η + 4)$
$ℑ_{M} (q_{η} \| M_{G}^{*})$ :( $η = α + 2$ )	$(2 α - η + 2, 2 α - η + 3, η - 1, η - α, α - η + 4)$
$ℑ_{M} (q_{η} \| M_{G}^{*})$ :( $α + 3 \leq η \leq 2 α$ )	$(2 α - η + 2, 2 α - η + 3, 2 α - η + 4, η - α, η - α - 1)$

$ℑ_{M} (υ | M_{G}^{*})$ & $M_{G}^{*} = {p_{1}, s_{1}, s_{2}, s_{α + 1}, s_{α + 2}}$
$ℑ_{M} (r_{η} | M_{G}^{*})$ : ( $η = 1$ ) & $(η + 1, 1, 3, α - η + 3, α + 1)$
$ℑ_{M} (r_{η} | M_{G}^{*})$ : ( $η = 2$ ) & $(η + 1, η + 1, 1, α - η + 3, α - η + 4)$
$ℑ_{M} (r_{η} | M_{G}^{*})$ : ( $3 \leq η \leq α$ ) & $(η + 1, η + 1, η, α - η + 3, α - η + 4)$
$ℑ_{M} (r_{η} | M_{G}^{*})$ : ( $η = α + 1$ ) & $(2 α - η + 2, η + 1, η, 1, α - η + 4)$
$ℑ_{M} (r_{η} | M_{G}^{*})$ : ( $η = α + 2$ ) & $(2 α - η + 2, 2 α - η + 3, η, η - α + 1, 1)$
$ℑ_{M} (r_{η} | M_{G}^{*})$ : ( $α + 3 \leq η \leq 2 α$ ) & $(2 α - η + 2, 2 α - η + 3, 2 α - η + 4, η - α + 1, η - α)$

$ℑ_{M} (υ | M_{G}^{*})$ & $M_{G}^{*} = {p_{1}, s_{1}, s_{2}, s_{α + 1}, s_{α + 2}}$
$ℑ_{M} (s_{η} | M_{G}^{*})$ : ( $η = 1$ ) & $(η + 2, 0, 4, α - η + 4, α + 2)$
$ℑ_{M} (s_{η} | M_{G}^{*})$ : ( $η = 2$ ) & $(η + 2, η + 2, 0, α - η + 4, α - η + 5)$
$ℑ_{M} (s_{η} | M_{G}^{*})$ : ( $3 \leq η \leq α$ ) & $(η + 2, η + 2, η + 1, α - η + 4, α - η + 5)$
$ℑ_{M} (s_{η} | M_{G}^{*})$ : ( $η = α + 1$ ) & $(2 α - η + 3, 2 α - η + 4, η + 1, 0, α - η + 5)$
$ℑ_{M} (s_{η} | M_{G}^{*})$ : ( $η = α + 2$ ) & $(2 α - η + 3, 2 α - η + 4, 2 α - η + 5, η - α + 2, 0)$
$ℑ_{M} (s_{η} | M_{G}^{*})$ : ( $α + 3 \leq η \leq 2 α$ ) & $(2 α - η + 3, 2 α - η + 4, 2 α - η + 5, η - α + 2, η - α + 1)$

and the mixed metric codes for the edges ${ϵ = p_{η} p_{η + 1}, p_{η} q_{η}, q_{η} q_{η + 1}, q_{η} r_{η}, r_{η} q_{η + 1}, r_{η} s_{η} | η = 1, 2, 3, \dots, n}$ regarding the set $M_{G}^{*}$ are shown in the tables below, respectively.

$ℑ_{M} (ϵ | M_{G}^{*})$ & $M_{G}^{*} = {p_{1}, s_{1}, s_{2}, s_{α + 1}, s_{α + 2}}$
$ℑ_{M} (p_{η} p_{η + 1} | M_{G}^{*})$ : ( $η = 1$ ) & $(η - 1, 3, 3, α - η + 3, α + 1)$
$ℑ_{M} (p_{η} p_{η + 1} | M_{G}^{*})$ : ( $η = 2$ ) & $(η - 1, η + 1, 3, α - η + 3, α - η + 4)$
$ℑ_{M} (p_{η} p_{η + 1} | M_{G}^{*})$ : ( $3 \leq η \leq α$ ) & $(η - 1, η + 1, η, α - η + 3, α - η + 4)$
$ℑ_{M} (p_{η} p_{η + 1} | M_{G}^{*})$ : ( $η = α + 1$ ) & $(2 α - η, 2 α - η + 3, η, 3, α - η + 4)$
$ℑ_{M} (p_{η} p_{η + 1} | M_{G}^{*})$ : ( $η = α + 2$ ) & $(2 α - η, 2 α - η + 3, 2 α - η + 4, η - α + 1, 3)$
$ℑ_{M} (p_{η} p_{η + 1} | M_{G}^{*})$ : ( $α + 3 \leq η \leq 2 α$ ) & $(2 α - η, 2 α - η + 3, 2 α - η + 4, η - α + 1, η - α)$

$ℑ_{M} (ϵ | M_{G}^{*})$ & $M_{G}^{*} = {p_{1}, s_{1}, s_{2}, s_{α + 1}, s_{α + 2}}$
$ℑ_{M} (p_{η} q_{η} | M_{G}^{*})$ : ( $η = 1$ ) & $(η - 1, 2, 3, α + 1, α)$
$ℑ_{M} (p_{η} q_{η} | M_{G}^{*})$ : ( $η = 2$ ) & $(η - 1, η, 2, α - η + 3, α + 1)$
$ℑ_{M} (p_{η} q_{η} | M_{G}^{*})$ : ( $3 \leq η \leq α + 1$ ) & $(η - 1, η, η - 1, α - η + 3, α - η + 4)$
$ℑ_{M} (p_{η} q_{η} | M_{G}^{*})$ : ( $η = α + 2$ ) & $(2 α - η + 1, 2 α - η + 3, η - 1, η - α, α - η + 4)$
$ℑ_{M} (p_{η} q_{η} | M_{G}^{*})$ : ( $α + 3 \leq η \leq 2 α$ ) & $(2 α - η + 1, 2 α - η + 3, 2 α - η + 4, η - α, η - α - 1)$

$ℑ_{M} (ϵ | M_{G}^{*})$ & $M_{G}^{*} = {p_{1}, s_{1}, s_{2}, s_{α + 1}, s_{α + 2}}$
$ℑ_{M} (q_{η} q_{η + 1} | M_{G}^{*})$ : ( $η = 1$ ) & $(η, 2, 2, α - η + 2, α)$
$ℑ_{M} (q_{η} q_{η + 1} | M_{G}^{*})$ : ( $η = 2$ ) & $(η, η, 2, α - η + 2, α - η + 3)$
$ℑ_{M} (q_{η} q_{η + 1} | M_{G}^{*})$ : ( $3 \leq η \leq α$ ) & $(η, η, η - 1, α - η + 2, α - η + 3)$
$ℑ_{M} (q_{η} q_{η + 1} | M_{G}^{*})$ : ( $η = α + 1$ ) & $(2 α - η + 1, 2 α - η + 2, η - 1, 2, α - η + 3)$
$ℑ_{M} (q_{η} q_{η + 1} | M_{G}^{*})$ : ( $η = α + 2$ ) & $(2 α - η + 1, 2 α - η + 2, 2 α - η + 3, η - α, 2)$
$ℑ_{M} (q_{η} q_{η + 1} | M_{G}^{*})$ : ( $α + 3 \leq η \leq 2 α$ ) & $(2 α - η + 1, 2 α - η + 2, 2 α - η + 3, η - α, η - α - 1)$

$ℑ_{M} (ϵ | M_{G}^{*})$ & $M_{G}^{*} = {p_{1}, s_{1}, s_{2}, s_{α + 1}, s_{α + 2}}$
$ℑ_{M} (q_{η} r_{η} | M_{G}^{*})$ : ( $η = 1$ ) & $(η, 1, 3, α + 1, α)$
$ℑ_{M} (q_{η} r_{η} | M_{G}^{*})$ : ( $η = 2$ ) & $(η, η, 3, α - η + 2, α - η + 4)$
$ℑ_{M} (q_{η} r_{η} | M_{G}^{*})$ : ( $3 \leq η \leq α$ ) & $(η, η, η - 1, α - η + 3, α - η + 4)$
$ℑ_{M} (q_{η} r_{η} | M_{G}^{*})$ : ( $η = α + 1$ ) & $(η, η, η - 1, 1, α - η + 4)$
$ℑ_{M} (q_{η} r_{η} | M_{G}^{*})$ : ( $η = α + 2$ ) & $(2 α - η + 2, 2 α - η + 3, η - 1, η - α, 1)$
$ℑ_{M} (q_{η} r_{η} | M_{G}^{*})$ : ( $α + 3 \leq η \leq 2 α$ ) & $(2 α - η + 2, 2 α - η + 3, 2 α - η + 4, η - α, η - α - 1)$

$ℑ_{M} (ϵ | M_{G}^{*})$ & $M_{G}^{*} = {p_{1}, s_{1}, s_{2}, s_{α + 1}, s_{α + 2}}$
$ℑ_{M} (r_{η} q_{η + 1} | M_{G}^{*})$ : ( $η = 1$ ) & $(η + 1, 1, 2, α - η + 2, α + 1)$
$ℑ_{M} (r_{η} q_{η + 1} | M_{G}^{*})$ : ( $η = 2$ ) & $(η + 1, η + 1, 1, α - η + 2, α - η + 3)$
$ℑ_{M} (r_{η} q_{η + 1} | M_{G}^{*})$ : ( $3 \leq η \leq α$ ) & $(η + 1, η + 1, η, α - η + 2, α - η + 3)$
$ℑ_{M} (r_{η} q_{η + 1} | M_{G}^{*})$ : ( $η = α + 1$ ) & $(2 α - η + 1, 2 α - η + 2, η, 1, α - η + 3)$
$ℑ_{M} (r_{η} q_{η + 1} | M_{G}^{*})$ : ( $η = α + 2$ ) & $(2 α - η + 1, 2 α - η + 2, 2 α - η + 3, η - α + 1, 1)$
$ℑ_{M} (r_{η} q_{η + 1} | M_{G}^{*})$ : ( $α + 3 \leq η \leq 2 α$ ) & $(2 α - η + 1, 2 α - η + 2, 2 α - η + 3, η - α + 1, η - α)$

$ℑ_{M} (ϵ | M_{G}^{*})$ & $M_{G}^{*} = {p_{1}, s_{1}, s_{2}, s_{α + 1}, s_{α + 2}}$
$ℑ_{M} (r_{η} s_{η} | M_{G}^{*})$ : ( $η = 1$ ) & $(η + 1, 0, 3, α - η + 3, α + 1)$
$ℑ_{M} (r_{η} s_{η} | M_{G}^{*})$ : ( $η = 2$ ) & $(η + 1, η + 1, 0, α - η + 3, α - η + 4)$
$ℑ_{M} (r_{η} s_{η} | M_{G}^{*})$ : ( $3 \leq η \leq α$ ) & $(η + 1, η + 1, η, α - η + 3, α - η + 4)$
$ℑ_{M} (r_{η} s_{η} | M_{G}^{*})$ : ( $η = α + 1$ ) & $(2 α - η + 2, 2 α - η + 3, η, 0, α - η + 4)$
$ℑ_{M} (r_{η} s_{η} | M_{G}^{*})$ : ( $η = α + 2$ ) & $(2 α - η + 2, 2 α - η + 3, 2 α - η + 4, η - α + 1, 0)$
$ℑ_{M} (r_{η} s_{η} | M_{G}^{*})$ : ( $α + 3 \leq η \leq 2 α$ ) & $(2 α - η + 2, 2 α - η + 3, 2 α - η + 4, η - α + 1, η - α)$

Now, from these mixed metric codes of the edges and the vertices of the Prism allied graph $D_{n}^{t}$ concerning the set $M_{G}^{*}$ , we ascertain that for $1 \leq η \leq n$ and $η \neq 1, 2, α + 1, α + 2$ , $ℑ_{M} (q_{η} | M_{G}^{*}) = ℑ_{M} (r_{η} q_{η} | M_{G}^{*})$ , $ℑ_{M} (q_{η + 1} | M_{G}^{*}) = ℑ_{M} (r_{η} q_{η + 1} | M_{G}^{*})$ , and $ℑ_{M} (r_{η} | M_{G}^{*}) = ℑ_{M} (r_{η} s_{η} | M_{G}^{*})$ . For the remaining mixed metric edges and vertices codes in $D_{n}^{t}$ , we find no two vertices or edges with the same mixed metric codes. For $η = 3, 4, \dots, α - 1, α, α + 2, α + 3, \dots, n$ , we see that $ℑ_{M} (q_{η} | M_{G}^{*} \cup {s_{η}}) \neq ℑ_{M} (r_{η} q_{η} | M_{G}^{*} \cup {s_{η}})$ , $ℑ_{M} (q_{η + 1} | M_{G}^{*} \cup {s_{η}}) \neq ℑ_{M} (r_{η} q_{η + 1} | M_{G}^{*} \cup {s_{η}})$ , and $ℑ_{M} (r_{η} | M_{G}^{*} \cup {s_{η}}) \neq ℑ_{M} (r_{η} s_{η} | M_{G}^{*} \cup {s_{η}})$ . From this, we obtain $ℑ_{M} (q_{η} | M_{G}^{m}) \neq ℑ_{M} (r_{η} q_{η} | M_{G}^{m})$ , $ℑ_{M} (q_{η + 1} | M_{G}^{m}) \neq ℑ_{M} (r_{η} q_{η + 1} | M_{G}^{m})$ , and $ℑ_{M} (r_{η} | M_{G}^{m}) \neq ℑ_{M} (r_{η} s_{η} | M_{G}^{m})$ , for any $1 \leq η \leq n$ and so $| M_{G}^{m} | \leq n + 1$ , suggesting that $m d i m (D_{n}^{t}) = n + 1$ in this case.

Case-2 $n \equiv 1 (m o d 2)$ .
In this case, $n$ can be written as $n = 2 α + 1$ , where $α \in N$ and $α \geq 3$ . Let $M_{G}^{*} = {p_{1}, s_{1}, s_{2}, s_{α + 1}, s_{α + 2}} \subset V (D_{n}^{t})$ . Now, to figure out that $M_{G}^{*}$ is the MMG for the Prism allied graph $D_{n}^{t}$ , we consign the mixed metric codes for each vertex and each edge of the graph $D_{n}^{t}$ regarding $M_{G}^{*}$ .
Now, the mixed metric codes for the vertices ${υ = p_{η}, q_{η}, r_{η}, s_{η} | η = 1, 2, 3, \dots, n}$ regarding the set $M_{G}^{*}$ are shown below in the following four tables respectively.

$ℑ_{M} (υ | M_{G}^{*})$ & $M_{G}^{*} = {p_{1}, s_{1}, s_{2}, s_{α + 1}, s_{α + 2}}$
$ℑ_{M} (p_{η} | M_{G}^{*})$ : ( $η = 1$ ) & $(η - 1, 3, 4, α - η + 4, α + 2)$
$ℑ_{M} (p_{η} | M_{G}^{*})$ : ( $η = 2$ ) & $(η - 1, η + 1, 3, α - η + 4, α - η + 5)$
$ℑ_{M} (p_{η} | M_{G}^{*})$ : ( $3 \leq η \leq α + 1$ )& $(η - 1, η + 1, η, α - η + 4, α - η + 5)$
$ℑ_{M} (p_{η} | M_{G}^{*})$ : ( $η = α + 2$ ) & $(2 α - η + 2, 2 α - η + 5, η, η - α + 1, α - η + 5)$
$ℑ_{M} (p_{η} | M_{G}^{*})$ :( $α + 3 \leq η \leq 2 α + 1$ ) & $(2 α - η + 2, 2 α - η + 5, 2 α - η + 6, η - α + 1, η - α)$

$ℑ_{M} (υ | M_{G}^{*})$ & $M_{G}^{*} = {p_{1}, s_{1}, s_{2}, s_{α + 1}, s_{α + 2}}$
$ℑ_{M} (q_{η} | M_{G}^{*})$ : ( $η = 1$ ) & $(η, 2, 3, α - η + 3, α + 1)$
$ℑ_{M} (q_{η} | M_{G}^{*})$ : ( $η = 2$ ) & $(η, η, 2, α - η + 3, α - η + 4)$
$ℑ_{M} (q_{η} | M_{G}^{*})$ : ( $3 \leq η \leq α + 1$ ) & $(η, η, η - 1, α - η + 3, α - η + 4)$
$ℑ_{M} (q_{η} | M_{G}^{*})$ : ( $η = α + 2$ ) & $(2 α - η + 3, 2 α - η + 4, η - 1, η - α, α - η + 4)$
$ℑ_{M} (q_{η} | M_{G}^{*})$ : ( $α + 3 \leq η \leq 2 α + 1$ ) & $(2 α - η + 3, 2 α - η + 4, 2 α - η + 5, η - α, η - α - 1)$

$ℑ_{M} (υ | M_{G}^{*})$ & $M_{G}^{*} = {p_{1}, s_{1}, s_{2}, s_{α + 1}, s_{α + 2}}$
$ℑ_{M} (r_{η} | M_{G}^{*})$ : ( $η = 1$ ) & $(η + 1, 1, 3, α - η + 3, α + 2)$
$ℑ_{M} (r_{η} | M_{G}^{*})$ : ( $η = 2$ ) & $(η + 1, η + 1, 1, α - η + 3, α - η + 4)$
$ℑ_{M} (r_{η} | M_{G}^{*})$ : ( $3 \leq η \leq α$ ) & $(η + 1, η + 1, η, α - η + 3, α - η + 4)$
$ℑ_{M} (r_{η} | M_{G}^{*})$ : ( $η = α + 1$ ) & $(η + 1, η + 1, η, 1, α - η + 4)$
$ℑ_{M} (r_{η} | M_{G}^{*})$ : ( $η = α + 2$ ) & $(2 α - η + 3, 2 α - η + 4, η, η - α + 1, 1)$
$ℑ_{M} (r_{η} | M_{G}^{*})$ : ( $α + 3 \leq η \leq 2 α + 1$ ) & $(2 α - η + 3, 2 α - η + 4, 2 α - η + 5, η - α + 1, η - α)$

$ℑ_{M} (υ | M_{G}^{*})$ & $M_{G}^{*} = {p_{1}, s_{1}, s_{2}, s_{α + 1}, s_{α + 2}}$
$ℑ_{M} (s_{η} | M_{G}^{*})$ : ( $η = 1$ ) & $(η + 2, 0, 4, α - η + 4, α + 3)$
$ℑ_{M} (s_{η} | M_{G}^{*})$ : ( $η = 2$ ) & $(η + 2, η + 2, 0, α - η + 4, α - η + 5)$
$ℑ_{M} (s_{η} | M_{G}^{*})$ : ( $3 \leq η \leq α$ ) & $(η + 2, η + 2, η + 1, α - η + 4, α - η + 5)$
$ℑ_{M} (s_{η} | M_{G}^{*})$ : ( $η = α + 1$ ) & $(η + 2, η + 2, η + 1, 0, α - η + 5)$
$ℑ_{M} (s_{η} | M_{G}^{*})$ : ( $η = α + 2$ ) & $(2 α - η + 4, 2 α - η + 5, η + 1, η - α + 2, 0)$
$ℑ_{M} (s_{η} | M_{G}^{*})$ : ( $α + 3 \leq η \leq 2 α + 1$ ) & $(2 α - η + 4, 2 α - η + 5, 2 α - η + 6, η - α + 2, η - α + 1)$

|m16.5em|m21.5em| $ℑ_{M} (ϵ | M_{G}^{*})$ & $M_{G}^{*} = {p_{1}, s_{1}, s_{2}, s_{α + 1}, s_{α + 2}}$
$ℑ_{M} (p_{η} p_{η + 1} | M_{G}^{*})$ : ( $η = 1$ ) & $(η - 1, 3, 3, α - η + 3, α + 2)$
$ℑ_{M} (p_{η} p_{η + 1} | M_{G}^{*})$ : ( $η = 2$ ) & $(η - 1, η + 1, 3, α - η + 3, α - η + 4)$
$ℑ_{M} (p_{η} p_{η + 1} | M_{G}^{*})$ : ( $3 \leq η \leq α$ ) & $(η - 1, η + 1, η, α - η + 3, α - η + 4)$
$ℑ_{M} (p_{η} p_{η + 1} | M_{G}^{*})$ : ( $η = α + 1$ ) & $(2 α - η + 1, η + 1, η, 3, α - η + 4)$
$ℑ_{M} (p_{η} p_{η + 1} | M_{G}^{*})$ : ( $η = α + 2$ ) & $(2 α - η + 1, 2 α - η + 4, η, η - α + 1, 3)$
$ℑ_{M} (p_{η} p_{η + 1} | M_{G}^{*})$ :( $α + 3 \leq η \leq 2 α + 1$ ) & $(2 α - η + 1, 2 α - η + 4, 2 α - η + 5, η - α + 1, η - α)$

$ℑ_{M} (ϵ | M_{G}^{*})$ & $M_{G}^{*} = {p_{1}, s_{1}, s_{2}, s_{α + 1}, s_{α + 2}}$
$ℑ_{M} (p_{η} q_{η} | M_{G}^{*})$ : ( $η = 1$ ) & $(η - 1, 2, 3, α - η + 3, α + 1)$
$ℑ_{M} (p_{η} q_{η} | M_{G}^{*})$ : ( $η = 2$ ) & $(η - 1, η, 2, α - η + 3, α - η + 4)$
$ℑ_{M} (p_{η} q_{η} | M_{G}^{*})$ : ( $3 \leq η \leq α + 1$ ) & $(η - 1, η, η - 1, α - η + 3, α - η + 4)$
$ℑ_{M} (p_{η} q_{η} | M_{G}^{*})$ : ( $η = α + 2$ ) & $(2 α - η + 2, 2 α - η + 4, η - 1, η - α, α - η + 4)$
$ℑ_{M} (p_{η} q_{η} | M_{G}^{*})$ : ( $α + 3 \leq η \leq 2 α + 1$ ) & $(2 α - η + 2, 2 α - η + 4, 2 α - η + 5, η - α, η - α - 1)$

|m16.5em|m21.5em| $ℑ_{M} (ϵ | M_{G}^{*})$ & $M_{G}^{*} = {p_{1}, s_{1}, s_{2}, s_{α + 1}, s_{α + 2}}$
$ℑ_{M} (q_{η} q_{η + 1} | M_{G}^{*})$ : ( $η = 1$ ) & $(η, 2, 2, α - η + 2, α + 1)$
$ℑ_{M} (q_{η} q_{η + 1} | M_{G}^{*})$ : ( $η = 2$ ) & $(η, η, 2, α - η + 2, α - η + 3)$
$ℑ_{M} (q_{η} q_{η + 1} | M_{G}^{*})$ : ( $3 \leq η \leq α$ ) & $(η, η, η - 1, α - η + 2, α - η + 3)$
$ℑ_{M} (q_{η} q_{η + 1} | M_{G}^{*})$ : ( $η = α + 1$ ) & $(2 α - η + 2, η, η - 1, 2, α - η + 3)$
$ℑ_{M} (q_{η} q_{η + 1} | M_{G}^{*})$ : ( $η = α + 2$ ) & $(2 α - η + 2, 2 α - η + 3, η - 1, η - α, 2)$
$ℑ_{M} (q_{η} q_{η + 1} | M_{G}^{*})$ :( $α + 3 \leq η \leq 2 α + 1$ ) & $(2 α - η + 2, 2 α - η + 3, 2 α - η + 4, η - α, η - α - 1)$

$ℑ_{M} (ϵ | M_{G}^{*})$ & $M_{G}^{*} = {p_{1}, s_{1}, s_{2}, s_{α + 1}, s_{α + 2}}$
$ℑ_{M} (q_{η} r_{η} | M_{G}^{*})$ : ( $η = 1$ ) & $(η, 1, 3, α - η + 3, α + 1)$
$ℑ_{M} (q_{η} r_{η} | M_{G}^{*})$ : ( $η = 2$ ) & $(η, η, 1, α - η + 3, α - η + 4)$
$ℑ_{M} (q_{η} r_{η} | M_{G}^{*})$ : ( $3 \leq η \leq α$ ) & $(η, η, η - 1, α - η + 3, α - η + 4)$
$ℑ_{M} (q_{η} r_{η} | M_{G}^{*})$ : ( $η = α + 1$ ) & $(η, η, η - 1, 1, α - η + 4)$
$ℑ_{M} (q_{η} r_{η} | M_{G}^{*})$ : ( $η = α + 2$ ) & $(2 α - η + 3, 2 α - η + 4, η - 1, η - α, 1)$
$ℑ_{M} (q_{η} r_{η} | M_{G}^{*})$ : ( $α + 3 \leq η \leq 2 α + 1$ ) & $(2 α - η + 3, 2 α - η + 4, 2 α - η + 5, η - α, η - α - 1)$

|m16.5em|m21.5em| $ℑ_{M} (ϵ | M_{G}^{*})$ & $M_{G}^{*} = {p_{1}, s_{1}, s_{2}, s_{α + 1}, s_{α + 2}}$
$ℑ_{M} (r_{η} q_{η + 1} | M_{G}^{*})$ : ( $η = 1$ ) & $(η + 1, 1, 2, α - η + 2, α - η + 3)$
$ℑ_{M} (r_{η} q_{η + 1} | M_{G}^{*})$ : ( $η = 2$ ) & $(η + 1, η + 1, 1, α - η + 2, α - η + 3)$
$ℑ_{M} (r_{η} q_{η + 1} | M_{G}^{*})$ : ( $3 \leq η \leq α$ ) & $(η + 1, η + 1, η, α - η + 2, α - η + 3)$
$ℑ_{M} (r_{η} q_{η + 1} | M_{G}^{*})$ : ( $η = α + 1$ ) & $(2 α - η + 2, 2 α - η + 3, η, 1, α - η + 3)$
$ℑ_{M} (r_{η} q_{η + 1} | M_{G}^{*})$ : ( $η = α + 2$ ) & $(2 α - η + 2, 2 α - η + 3, 2 α - η + 4, η - α + 1, 1)$
$ℑ_{M} (r_{η} q_{η + 1} | M_{G}^{*})$ :( $α + 3 \leq η \leq 2 α + 1$ ) & $(2 α - η + 2, 2 α - η + 3, 2 α - η + 4, η - α + 1, η - α)$

$ℑ_{M} (ϵ | M_{G}^{*})$ & $M_{G}^{*} = {p_{1}, s_{1}, s_{2}, s_{α + 1}, s_{α + 2}}$
$ℑ_{M} (r_{η} s_{η} | M_{G}^{*})$ : ( $η = 1$ ) & $(η + 1, 0, 3, α - η + 3, α + 2)$
$ℑ_{M} (r_{η} s_{η} | M_{G}^{*})$ : ( $η = 2$ ) & $(η + 1, η + 1, 0, α - η + 3, α - η + 4)$
$ℑ_{M} (r_{η} s_{η} | M_{G}^{*})$ : ( $3 \leq η \leq α$ ) & $(η + 1, η + 1, η, α - η + 3, α - η + 4)$
$ℑ_{M} (r_{η} s_{η} | M_{G}^{*})$ : ( $η = α + 1$ ) & $(η + 1, η + 1, η, 0, α - η + 4)$
$ℑ_{M} (r_{η} s_{η} | M_{G}^{*})$ : ( $η = α + 2$ ) & $(2 α - η + 3, 2 α - η + 4, η, η - α + 1, 0)$
$ℑ_{M} (r_{η} s_{η} | M_{G}^{*})$ : ( $α + 3 \leq η \leq 2 α + 1$ ) & $(2 α - η + 3, 2 α - η + 4, 2 α - η + 5, η - α + 1, η - α)$

Now, from these mixed metric codes of the edges and the vertices of the Prism allied graph $D_{n}^{t}$ concerning the set $M_{G}^{*}$ , we ascertain that for $1 \leq η \leq n$ and $η \neq 1, 2, α + 1, α + 2$ , $ℑ_{M} (q_{η} | M_{G}^{*}) = ℑ_{M} (r_{η} q_{η} | M_{G}^{*})$ , $ℑ_{M} (q_{η + 1} | M_{G}^{*}) = ℑ_{M} (r_{η} q_{η + 1} | M_{G}^{*})$ , and $ℑ_{M} (r_{η} | M_{G}^{*}) = ℑ_{M} (r_{η} s_{η} | M_{G}^{*})$ . For the remaining mixed metric edges and vertices codes in $D_{n}^{t}$ , we find no two vertices or edges with the same mixed metric codes. For $η = 3, 4, \dots, α - 1, α, α + 2, α + 3, \dots, n$ , we see that $ℑ_{M} (q_{η} | M_{G}^{*} \cup {s_{η}}) \neq ℑ_{M} (r_{η} q_{η} | M_{G}^{*} \cup {s_{η}})$ , $ℑ_{M} (q_{η + 1} | M_{G}^{*} \cup {s_{η}}) \neq ℑ_{M} (r_{η} q_{η + 1} | M_{G}^{*} \cup {s_{η}})$ , and $ℑ_{M} (r_{η} | M_{G}^{*} \cup {s_{η}}) \neq ℑ_{M} (r_{η} s_{η} | M_{G}^{*} \cup {s_{η}})$ . From this, we obtain $ℑ_{M} (q_{η} | M_{G}^{m}) \neq ℑ_{M} (r_{η} q_{η} | M_{G}^{m})$ , $ℑ_{M} (q_{η + 1} | M_{G}^{m}) \neq ℑ_{M} (r_{η} q_{η + 1} | M_{G}^{m})$ , and $ℑ_{M} (r_{η} | M_{G}^{m}) \neq ℑ_{M} (r_{η} s_{η} | M_{G}^{m})$ , for any $1 \leq η \leq n$ and so $| M_{G} | \leq n + 1$ , suggesting that $m d i m (D_{n}^{t}) = n + 1$ in this case also, which concludes the theorem.

Theorem 6. The independent mixed metric number for the Prism allied graph $D_{n}^{t}$ , for $n \geq 4$ is $n + 1$ .

Proof. For proof, refer to Theorem $5$ .

4. Mixed Resolvability of the Web Graph $W_{n}$

The Web graph $W_{n}$ [16] has a vertex set of cardinality $3 n$ and an edge set of cardinality $4 n$ , indicated by $V (W_{n})$ and $E (W_{n})$ respectively, where $V (W_{n}) = {p_{η}, q_{η}, r_{η} | 1 \leq η \leq n}$ and $E (W_{n}) = {p_{η} q_{η}, p_{η} p_{η + 1}, q_{η} q_{η + 1}, r_{η} q_{η} | 1 \leq η \leq n}$ . It comprises of $n$ $4$ -sided faces, $n$ pendant edges, and an $n$ -sided face (see Figure 2). The Web graph $W_{n}$ can also be obtained from the Prism graph $D_{n}$ by simply including $n$ new pendant edges $q_{η} r_{η}$ $(1 \leq η \leq n)$ .

Figure 2. The Web Graph $W_{n}$ , for $n \geq 4$ .

For our smooth purpose, we refer to the cycle brought forth by the arrangement of vertices ${q_{η} : 1 ⩽ η ⩽ n}$ and ${p_{η} : 1 ⩽ η ⩽ n}$ in the graph, $W_{n}$ as the $q$ and $p$ -cycle respectively, the arrangement of vertices ${r_{η} : 1 ⩽ η ⩽ n}$ , in the graph, $W_{n}$ as the set of pendant vertices respectively. For our convenience, we consider $r_{1} = r_{n + 1}$ , $q_{1} = q_{n + 1}$ , and $p_{1} = p_{n + 1}$ . In this working section, we obtain that the least possible cardinality for the MMG $M_{G}^{m}$ of the Web graph $W_{n}$ is $n + 1$ . For this, we also see that the MMG $M_{G}^{m}$ for the Web graph $W_{n}$ is independent. Now, in order to get the exact MMD of graph $W_{n}$ , we need the following Lemmas:

Lemma 4. The set of outer vertices ${r_{η} | 1 \leq η \leq n} \subset M_{G}^{m}$ , where $M_{G}^{m}$ is a MMG for the Web graph $W_{n}$ .

Proof. For the inconsistency, we suppose that the MMG $M_{G}^{m}$ , does not contain at least one vertex from the set ${r_{η} | 1 \leq η \leq n}$ . Without loss of generality, we suppose that $r_{η} \notin M_{G}^{m}$ , for any $η$ . At that point, we have $ℑ_{M} (r_{η} | M_{G}^{m}) = ℑ_{M} (r_{η} q_{η} | M_{G}^{m})$ , a contradiction.

Lemma 5. Let $P = {p_{η} | 1 \leq η \leq n}$ and $M_{G}^{m}$ be any MMG for the Web graph $W_{n}$ . Then, $P \cap M_{G}^{m} \neq \emptyset$ .

In the accompanying Lemma, we show that the cardinality of any MMG for the Web graph $W_{n}$ is greater than or equals to $n + 1$ i.e., $| M_{G}^{m} | \geq n + 1$ .

Lemma 6. For the Web graph $W_{n}$ and $n \geq 4$ , we have $m d i m (W_{n}) \geq n + 1$ .

Proof. On contrary, we suppose that the cardinality of the MMG $M_{G}^{m}$ of the Web graph $W_{n}$ is equals $n$ i.e., $β_{M} (W_{n}) = n$ . Then, on combining Lemma 4 and 5, we get contradiction as the cardinality of the set ${r_{η} | 1 \leq η \leq n}$ is $n$ . So, we must have $β_{M} (W_{n}) \geq n + 1$ .

Now, for the Web graph $W_{n}$ , we have the following important result regarding its MMD:

Theorem 7. For the Web graph $W_{n}$ , we have $m d i m (W_{n}) = n + 1$ , $\forall$ $n \geq 4$ .

Proof. By Lemma 6, we have $m d i m (W_{n}) \geq n + 1$ . Now, in order to complete the proof of the theorem, we have to show that $m d i m (W_{n}) \leq n + 1$ . For this, suppose $M_{G}^{m} = {p_{1}, r_{1}, r_{2}, \dots, r_{n - 1}, r_{n}} \subset V (W_{n})$ (for the location of these vertices, see Figure 2 (vertices in purple color)). We will show that $M_{G}^{m}$ is the mixed metric basis set for the Web graph $W_{n}$ . By total enumeration, it can be easily checked that the set $M_{G}^{m}$ is the mixed metric basis set for the Web graph $W_{n}$ , when $n = 4, 5$ . Now, for $n \geq 6$ , we consider the following two cases regarding the positive integer $n$ (i.e., when $n \equiv 0 (m o d n)$ and $n \equiv 1 (m o d 2)$ ).

Case-1 $n \equiv 0 (m o d 2)$ .
In this case, $n$ can be written as $n = 2 α$ , where $α \in N$ and $α \geq 3$ . Let $M_{G}^{*} = {p_{1}, r_{1}, r_{2}, r_{α + 1}, r_{α + 2}} \subset V (W_{n})$ . Now, to figure out that $M_{G}^{*}$ is the MMG for the Web graph $W_{n}$ , we consign the mixed metric codes for each vertex and each edge of the graph $W_{n}$ regarding $M_{G}^{*}$ .
Now, the mixed metric codes for the vertices ${υ = p_{η}, q_{η}, r_{η} | η = 1, 2, 3, \dots, n}$ regarding the set $M_{G}^{*}$ are shown below in the following three tables respectively.

$ℑ_{M} (υ | M_{G}^{*})$ & $M_{G}^{*} = {p_{1}, r_{1}, r_{2}, r_{α + 1}, r_{α + 2}}$
$ℑ_{M} (p_{η} | M_{G}^{*})$ : ( $η = 1$ ) & $(η - 1, η + 1, 3, α - η + 3, α + 1)$
$ℑ_{M} (p_{η} | M_{G}^{*})$ : ( $2 \leq η \leq α + 1$ ) & $(η - 1, η + 1, η, α - η + 3, α - η + 4)$
$ℑ_{M} (p_{η} | M_{G}^{*})$ : ( $η = α + 2$ ) & $(2 α - η + 1, 2 α - η + 3, η, η - α + 1, α - η + 4)$
$ℑ_{M} (p_{η} | M_{G}^{*})$ : ( $α + 3 \leq η \leq 2 α$ ) & $(2 α - η + 1, 2 α - η + 3, 2 α - η + 4, η - α + 1, η - α)$

$ℑ_{M} (υ | M_{G}^{*})$ & $M_{G}^{*} = {p_{1}, r_{1}, r_{2}, r_{α + 1}, r_{α + 2}}$
$ℑ_{M} (q_{η} | M_{G}^{*})$ : ( $η = 1$ ) & $(η, η, 2, α - η + 2, α)$
$ℑ_{M} (q_{η} | M_{G}^{*})$ : ( $2 \leq η \leq α + 1$ ) & $(η, η, η - 1, α - η + 2, α - η + 3)$
$ℑ_{M} (q_{η} | M_{G}^{*})$ : ( $η = α + 2$ ) & $(2 α - η + 2, 2 α - η + 2, η - 1, η - α, α - η + 3)$
$ℑ_{M} (q_{η} | M_{G}^{*})$ : ( $α + 3 \leq η \leq 2 α$ ) & $(2 α - η + 2, 2 α - η + 2, 2 α - η + 3, η - α, η - α - 1)$

$ℑ_{M} (υ | M_{G}^{*})$ & $M_{G}^{*} = {p_{1}, r_{1}, r_{2}, r_{α + 1}, r_{α + 2}}$
$ℑ_{M} (r_{η} | M_{G}^{*})$ : ( $η = 1$ ) & $(η + 1, 0, 3, α - η + 3, α + 1)$
$ℑ_{M} (r_{η} | M_{G}^{*})$ : ( $η = 2$ ) & $(η + 1, η + 1, 0, α - η + 3, α - η + 4)$
$ℑ_{M} (r_{η} | M_{G}^{*})$ : ( $3 \leq η \leq α$ ) & $(η + 1, η + 1, η, α - η + 3, α - η + 4)$
$ℑ_{M} (r_{η} | M_{G}^{*})$ : ( $η = α + 1$ ) & $(η + 1, η + 1, η, 0, α - η + 4)$
$ℑ_{M} (r_{η} | M_{G}^{*})$ : ( $η = α + 2$ ) & $(2 α - η + 3, 2 α - η + 3, η, η - α + 1, 0)$
$ℑ_{M} (r_{η} | M_{G}^{*})$ : ( $α + 3 \leq η \leq 2 α$ ) & $(2 α - η + 3, 2 α - η + 3, 2 α - η + 4, η - α + 1, η - α)$

and the mixed metric codes for the edges ${ϵ = p_{η} p_{η + 1}, p_{η} q_{η}, q_{η} q_{η + 1}, q_{η} r_{η} | η = 1, 2, 3, \dots, n}$ regarding the set $M_{G}^{*}$ are shown in the tables below, respectively.

$ℑ_{M} (ϵ | M_{G}^{*})$ & $M_{G}^{*} = {p_{1}, r_{1}, r_{2}, r_{α + 1}, r_{α + 2}}$
$ℑ_{M} (p_{η} p_{η + 1} | M_{G}^{*})$ : ( $η = 1$ ) & $(η - 1, η + 1, 2, α - η + 2, α + 1)$
$ℑ_{M} (p_{η} p_{η + 1} | M_{G}^{*})$ : ( $2 \leq η \leq α$ ) & $(η - 1, η + 1, η, α - η + 2, α - η + 3)$
$ℑ_{M} (p_{η} p_{η + 1} | M_{G}^{*})$ : ( $η = α + 1$ ) & $(2 α - η, 2 α - η + 2, η, η - α + 1, α - η + 3)$
$ℑ_{M} (p_{η} p_{η + 1} | M_{G}^{*})$ : ( $α + 2 \leq η \leq 2 α$ ) & $(2 α - η, 2 α - η + 2, 2 α - η + 3, η - α + 1, η - α)$

$ℑ_{M} (ϵ | M_{G}^{*})$ & $M_{G}^{*} = {p_{1}, r_{1}, r_{2}, r_{α + 1}, r_{α + 2}}$
$ℑ_{M} (p_{η} q_{η} | M_{G}^{*})$ : ( $η = 1$ ) & $(η - 1, η, 2, α - η + 2, α)$
$ℑ_{M} (p_{η} q_{η} | M_{G}^{*})$ : ( $3 \leq η \leq α + 1$ ) & $(η - 1, η, η - 1, α - η + 2, α - η + 3)$
$ℑ_{M} (p_{η} q_{η} | M_{G}^{*})$ : ( $η = α + 2$ ) & $(2 α - η + 1, 2 α - η + 2, η - 1, η - α, α - η + 3)$
$ℑ_{M} (p_{η} q_{η} | M_{G}^{*})$ : ( $α + 3 \leq η \leq 2 α$ ) & $(2 α - η + 1, 2 α - η + 2, 2 α - η + 3, η - α, η - α - 1)$

$ℑ_{M} (ϵ | M_{G}^{*})$ & $M_{G}^{*} = {p_{1}, r_{1}, r_{2}, r_{α + 1}, r_{α + 2}}$
$ℑ_{M} (q_{η} q_{η + 1} | M_{G}^{*})$ : ( $η = 1$ ) & $(η, η, 1, α - η + 1, α)$
$ℑ_{M} (q_{η} q_{η + 1} | M_{G}^{*})$ : ( $2 \leq η \leq α$ ) & $(η, η, η - 1, α - η + 1, α - η + 2)$
$ℑ_{M} (q_{η} q_{η + 1} | M_{G}^{*})$ : ( $η = α + 1$ ) & $(2 α - η + 1, 2 α - η + 1, η - 1, η - α, α - η + 2)$
$ℑ_{M} (q_{η} q_{η + 1} | M_{G}^{*})$ : ( $α + 2 \leq η \leq 2 α$ ) & $(2 α - η + 1, 2 α - η + 1, 2 α - η + 2, η - α, η - α - 1)$

$ℑ_{M} (ϵ | M_{G}^{*})$ & $M_{G}^{*} = {p_{1}, r_{1}, r_{2}, r_{α + 1}, r_{α + 2}}$
$ℑ_{M} (q_{η} r_{η} | M_{G}^{*})$ : ( $η = 1$ ) & $(η, 0, 2, α - η + 2, α)$
$ℑ_{M} (q_{η} r_{η} | M_{G}^{*})$ : ( $η = 2$ ) & $(η, η, 0, α - η + 2, α - η + 3)$
$ℑ_{M} (q_{η} r_{η} | M_{G}^{*})$ : ( $3 \leq η \leq α$ ) & $(η, η, η - 1, α - η + 2, α - η + 3)$
$ℑ_{M} (q_{η} r_{η} | M_{G}^{*})$ : ( $η = α + 1$ ) & $(η, η, η - 1, 0, α - η + 3)$
$ℑ_{M} (q_{η} r_{η} | M_{G}^{*})$ : ( $η = α + 2$ ) & $(2 α - η + 2, 2 α - η + 2, η - 1, η - α, 0)$
$ℑ_{M} (q_{η} r_{η} | M_{G}^{*})$ : ( $α + 3 \leq η \leq 2 α$ ) & $(2 α - η + 2, 2 α - η + 2, 2 α - η + 3, η - α, η - α - 1)$

Now, from these mixed metric codes of the edges and the vertices of the Web graph $W_{n}$ concerning the set $M_{G}^{*}$ , we ascertain that for $1 \leq η \leq n$ and $η \neq 1, 2, α + 1, α + 2$ , $ℑ_{M} (q_{η} | M_{G}^{*}) = ℑ_{M} (r_{η} q_{η} | M_{G}^{*})$ . For the remaining mixed metric edges and vertices codes in $W_{n}$ , we find no two vertices or edges with the same mixed metric codes. For $η = 3, 4, \dots, α - 1, α, α + 2, α + 3, \dots, n$ , we see that $ℑ_{M} (q_{η} | M_{G}^{*} \cup {r_{η}}) \neq ℑ_{M} (r_{η} q_{η} | M_{G}^{*} \cup {r_{η}})$ . From this, we obtain $ℑ_{M} (q_{η} | M_{G}^{m}) \neq ℑ_{M} (r_{η} q_{η} | M_{G}^{m})$ , for any $1 \leq η \leq n$ and so $| M_{G}^{m} | \leq n + 1$ , suggesting that $m d i m (W_{n}) = n + 1$ in this case.

Case-2 $n \equiv 1 (m o d 2)$ .
In this case, $n$ can be written as $n = 2 α + 1$ , where $α \in N$ and $α \geq 3$ . Let $M_{G}^{*} = {p_{1}, r_{1}, r_{2}, r_{α + 1}, r_{α + 2}} \subset V (W_{n})$ . Now, to figure out that $M_{G}^{*}$ is the MMG for the Web graph $W_{n}$ , we consign the mixed metric codes for each vertex and each edge of the graph $W_{n}$ regarding $M_{G}^{*}$ .
Now, the mixed metric codes for the vertices ${υ = p_{η}, q_{η}, r_{η} | η = 1, 2, 3, \dots, n}$ regarding the set $M_{G}^{*}$ are shown below in the following three tables respectively.

$ℑ_{M} (υ | M_{G}^{*})$ & $M_{G}^{*} = {p_{1}, r_{1}, r_{2}, r_{α + 1}, r_{α + 2}}$
$ℑ_{M} (p_{η} | M_{G}^{*})$ : ( $η = 1$ ) & $(η - 1, η + 1, 3, α - η + 3, α + 2)$
$ℑ_{M} (p_{η} | M_{G}^{*})$ : ( $2 \leq η \leq α + 1$ )& $(η - 1, η + 1, η, α - η + 3, α - η + 4)$
$ℑ_{M} (p_{η} | M_{G}^{*})$ : ( $η = α + 2$ ) & $(2 α - η + 2, 2 α - η + 4, η, η - α + 1, α - η + 4)$
$ℑ_{M} (p_{η} | M_{G}^{*})$ : ( $α + 3 \leq η \leq 2 α + 1$ ) & $(2 α - η + 2, 2 α - η + 4, 2 α - η + 5, η - α + 1, η - α)$

$ℑ_{M} (υ | M_{G}^{*})$ & $M_{G}^{*} = {p_{1}, r_{1}, r_{2}, r_{α + 1}, r_{α + 2}}$
$ℑ_{M} (q_{η} | M_{G}^{*})$ : ( $η = 1$ ) & $(η, η, 2, α - η + 2, α + 1)$
$ℑ_{M} (q_{η} | M_{G}^{*})$ : ( $2 \leq η \leq α + 1$ ) & $(η, η, η - 1, α - η + 2, α - η + 3)$
$ℑ_{M} (q_{η} | M_{G}^{*})$ : ( $η = α + 2$ ) & $(2 α - η + 3, 2 α - η + 3, η - 1, η - α, α - η + 3)$
$ℑ_{M} (q_{η} | M_{G}^{*})$ : ( $α + 3 \leq η \leq 2 α + 1$ ) & $(2 α - η + 3, 2 α - η + 3, 2 α - η + 4, η - α, η - α - 1)$

$ℑ_{M} (υ | M_{G}^{*})$ & $M_{G}^{*} = {p_{1}, r_{1}, r_{2}, r_{α + 1}, r_{α + 2}}$
$ℑ_{M} (r_{η} | M_{G}^{*})$ : ( $η = 1$ ) & $(η + 1, 0, 3, α - η + 3, α + 2)$
$ℑ_{M} (r_{η} | M_{G}^{*})$ : ( $η = 2$ ) & $(η + 1, η + 1, 0, α - η + 3, α - η + 4)$
$ℑ_{M} (r_{η} | M_{G}^{*})$ : ( $3 \leq η \leq α$ ) & $(η + 1, η + 1, η, α - η + 3, α - η + 4)$
$ℑ_{M} (r_{η} | M_{G}^{*})$ : ( $η = α + 1$ ) & $(η + 1, η + 1, η, 0, α - η + 4)$
$ℑ_{M} (r_{η} | M_{G}^{*})$ : ( $η = α + 2$ ) & $(2 α - η + 4, 2 α - η + 4, η, η - α + 1, 0)$
$ℑ_{M} (r_{η} | M_{G}^{*})$ : ( $α + 3 \leq η \leq 2 α + 1$ ) & $(2 α - η + 4, 2 α - η + 4, 2 α - η + 5, η - α + 1, η - α)$

|m16.5em|m21.5em| $ℑ_{M} (ϵ | M_{G}^{*})$ & $M_{G}^{*} = {p_{1}, r_{1}, r_{2}, r_{α + 1}, r_{α + 2}}$
$ℑ_{M} (p_{η} p_{η + 1} | M_{G}^{*})$ : ( $η = 1$ ) & $(η - 1, η + 1, 2, α - η + 2, α - η + 3)$
$ℑ_{M} (p_{η} p_{η + 1} | M_{G}^{*})$ : ( $2 \leq η \leq α$ ) & $(η - 1, η + 1, η, α - η + 2, α - η + 3)$
$ℑ_{M} (p_{η} p_{η + 1} | M_{G}^{*})$ : ( $η = α + 1$ ) & $(η - 1, η + 1, η, η - α + 1, α - η + 3)$
$ℑ_{M} (p_{η} p_{η + 1} | M_{G}^{*})$ : ( $η = α + 2$ ) & $(2 α - η + 1, 2 α - η + 3, η, η - α + 1, η - α)$
$ℑ_{M} (p_{η} p_{η + 1} | M_{G}^{*})$ :( $α + 3 \leq η \leq 2 α + 1$ ) & $(2 α - η + 1, 2 α - η + 3, 2 α - η + 4, η - α + 1, η - α)$

$ℑ_{M} (ϵ | M_{G}^{*})$ & $M_{G}^{*} = {p_{1}, r_{1}, r_{2}, r_{α + 1}, r_{α + 2}}$
$ℑ_{M} (p_{η} q_{η} | M_{G}^{*})$ : ( $η = 1$ ) & $(η - 1, η, 2, α - η + 2, α + 1)$
$ℑ_{M} (p_{η} q_{η} | M_{G}^{*})$ : ( $2 \leq η \leq α + 1$ ) & $(η - 1, η, η - 1, α - η + 2, α - η + 3)$
$ℑ_{M} (p_{η} q_{η} | M_{G}^{*})$ : ( $η = α + 2$ ) & $(2 α - η + 2, 2 α - η + 3, η - 1, η - α, α - η + 3)$
$ℑ_{M} (p_{η} q_{η} | M_{G}^{*})$ : ( $α + 3 \leq η \leq 2 α + 1$ ) & $(2 α - η + 2, 2 α - η + 3, 2 α - η + 4, η - α, η - α - 1)$

|m16.5em|m21.5em| $ℑ_{M} (ϵ | M_{G}^{*})$ & $M_{G}^{*} = {p_{1}, r_{1}, r_{2}, r_{α + 1}, r_{α + 2}}$
$ℑ_{M} (q_{η} q_{η + 1} | M_{G}^{*})$ : ( $η = 1$ ) & $(η, η, 1, α - η + 1, α - η + 2)$
$ℑ_{M} (q_{η} q_{η + 1} | M_{G}^{*})$ : ( $2 \leq η \leq α$ ) & $(η, η, η - 1, α - η + 1, α - η + 2)$
$ℑ_{M} (q_{η} q_{η + 1} | M_{G}^{*})$ : ( $η = α + 1$ ) & $(η, η, η - 1, η - α, α - η + 2)$
$ℑ_{M} (q_{η} q_{η + 1} | M_{G}^{*})$ : ( $η = α + 2$ ) & $(2 α - η + 2, 2 α - η + 2, η - 1, η - α, η - α - 1)$
$ℑ_{M} (q_{η} q_{η + 1} | M_{G}^{*})$ :( $α + 3 \leq η \leq 2 α + 1$ ) & $(2 α - η + 2, 2 α - η + 2, 2 α - η + 3, η - α, η - α - 1)$

$ℑ_{M} (ϵ | M_{G}^{*})$ & $M_{G}^{*} = {p_{1}, r_{1}, r_{2}, r_{α + 1}, r_{α + 2}}$
$ℑ_{M} (q_{η} r_{η} | M_{G}^{*})$ : ( $η = 1$ ) & $(η, 0, 2, α - η + 2, α + 1)$
$ℑ_{M} (q_{η} r_{η} | M_{G}^{*})$ : ( $η = 2$ ) & $(η, η, 0, α - η + 2, α - η + 3)$
$ℑ_{M} (q_{η} r_{η} | M_{G}^{*})$ : ( $3 \leq η \leq α$ ) & $(η, η, η - 1, α - η + 2, α - η + 3)$
$ℑ_{M} (q_{η} r_{η} | M_{G}^{*})$ : ( $η = α + 1$ ) & $(η, η, η - 1, 0, α - η + 3)$
$ℑ_{M} (q_{η} r_{η} | M_{G}^{*})$ : ( $η = α + 2$ ) & $(2 α - η + 3, 2 α - η + 3, η - 1, η - α, 0)$
$ℑ_{M} (q_{η} r_{η} | M_{G}^{*})$ : ( $α + 3 \leq η \leq 2 α + 1$ ) & $(2 α - η + 3, 2 α - η + 3, 2 α - η + 4, η - α, η - α - 1)$

Theorem 8. The independent mixed metric number for the Web graph $W_{n}$ , for $n \geq 4$ is $n + 1$ .

Proof. For proof, refer to Theorem $7$ .

5. Conclusion

In this examination, we determined the MMD for the two important families of the plane graphs viz., the Web graph $W_{n}$ ([16], see Figure 2) and the Prism allied graph $D_{n}^{t}$ ([15], see Figure 1), and which was found to be non-constant unbounded for these two families of the plane graph. Moreover, for the Web graph $W_{n}$ and the Prism allied graph $D_{n}^{t}$ , we unveil that the mixed metric basis set $M_{G}^{m}$ is independent. From preliminaries and these results, for these two families of plane graphs $H = D_{n}^{t}$ and $H = W_{n}$ , we determined that $β (H) < β_{E} (H) < β_{M} (H)$ , for every $n \geq 5$ .

Conflict of Interest

The authors declare no conflict of interests.

References:

Slater, P.J., 1975. Leaves of trees. Congressus Numerantium, 14, pp.549-559.[Google Scholor]
Harary, F. and Melter, R.A., 1976. On the metric dimension of a graph. Ars Combinatoria, 2, pp.191-195.[Google Scholor]
Melter, R.A. and Tomescu, I., 1984. Metric bases in digital geometry. Computer vision, graphics, and image Processing, 25(1), pp.113-121.[Google Scholor]
Chartrand, G., Eroh, L., Johnson, M.A. and Oellermann, O.R., 2000. Resolvability in graphs and the metric dimension of a graph. Discrete Applied Mathematics, 105(1-3), pp.99-113.[Google Scholor]
Khuller, S., Raghavachari, B. and Rosenfeld, A., 1996. Landmarks in graphs. Discrete applied mathematics, 70(3), pp.217-229.[Google Scholor]
Beerliova, Z., Eberhard, F., Erlebach, T., Hall, A., Hoffmann, M., Mihal’ak, M. and Ram, L.S., 2006. Network discovery and verification. IEEE Journal on selected areas in communications, 24(12), pp.2168-2181.[Google Scholor]
Sebo, A. and Tannier, E., 2004. On metric generators of graphs. Mathematics of Operations Research, 29(2), pp.383-393.[Google Scholor]
Sharma, S.K. and Bhat, V.K., 2021. Metric dimension of heptagonal circular ladder. Discrete Mathematics, Algorithms and Applications, 13(01), p.2050095.[Google Scholor]
Sharma, S.K. and Bhat, V.K., 2022. Fault-tolerant metric dimension of two-fold heptagonal-nonagonal circular ladder. Discrete Mathematics, Algorithms and Applications, 14(03), p.2150132.[Google Scholor]
Tomescu, I. and Imran, M., 2011. Metric dimension and R-sets of connected graphs. Graphs and Combinatorics, 27(4), pp.585-591.[Google Scholor]
Kelenc, A., Tratnik, N. and Yero, I.G., 2018. Uniquely identifying the edges of a graph: the edge metric dimension. Discrete Applied Mathematics, 251, pp.204-220.[Google Scholor]
Kelenc, A., Kuziak, D., Taranenko, A. and Yero, I.G., 2017. Mixed metric dimension of graphs. Applied Mathematics and Computation, 314, pp.429-438.[Google Scholor]
Sharma, S.K. and Bhat, V.K., 2021. On some plane graphs and their metric dimension. International Journal of Applied and Computational Mathematics, 7, pp.1-15.[Google Scholor]
Xing, B.H., Sharma, S.K., Bhat, V.K., Raza, H. and Liu, J.B., 2021. The vertex-edge resolvability of some wheel-related graphs. Journal of Mathematics, 2021, pp.1-16.[Google Scholor]
Ahsan, M., Zahid, Z., Zafar, S., Rafiq, A., Sindhu, M.S. and Umar, M., 2021. Computing the edge metric dimension of convex polytopes related graphs. Journal of Mathematics and Computer Science, 22, pp.174-188.[Google Scholor]
Zhang, Y. and Gao, S., 2020. On the edge metric dimension of convex polytopes and its related graphs. Journal of Combinatorial Optimization, 39(2), pp.334-350.[Google Scholor]

[1] Slater, P.J., 1975. Leaves of trees. Congressus Numerantium, 14, pp.549-559.[Google Scholor]

[2] Harary, F. and Melter, R.A., 1976. On the metric dimension of a graph. Ars Combinatoria, 2, pp.191-195.[Google Scholor]

[3] Melter, R.A. and Tomescu, I., 1984. Metric bases in digital geometry. Computer vision, graphics, and image Processing, 25(1), pp.113-121.[Google Scholor]

[4] Chartrand, G., Eroh, L., Johnson, M.A. and Oellermann, O.R., 2000. Resolvability in graphs and the metric dimension of a graph. Discrete Applied Mathematics, 105(1-3), pp.99-113.[Google Scholor]

[5] Khuller, S., Raghavachari, B. and Rosenfeld, A., 1996. Landmarks in graphs. Discrete applied mathematics, 70(3), pp.217-229.[Google Scholor]

[6] Beerliova, Z., Eberhard, F., Erlebach, T., Hall, A., Hoffmann, M., Mihal’ak, M. and Ram, L.S., 2006. Network discovery and verification. IEEE Journal on selected areas in communications, 24(12), pp.2168-2181.[Google Scholor]

[7] Sebo, A. and Tannier, E., 2004. On metric generators of graphs. Mathematics of Operations Research, 29(2), pp.383-393.[Google Scholor]

[8] Sharma, S.K. and Bhat, V.K., 2021. Metric dimension of heptagonal circular ladder. Discrete Mathematics, Algorithms and Applications, 13(01), p.2050095.[Google Scholor]

[9] Sharma, S.K. and Bhat, V.K., 2022. Fault-tolerant metric dimension of two-fold heptagonal-nonagonal circular ladder. Discrete Mathematics, Algorithms and Applications, 14(03), p.2150132.[Google Scholor]

[10] Tomescu, I. and Imran, M., 2011. Metric dimension and R-sets of connected graphs. Graphs and Combinatorics, 27(4), pp.585-591.[Google Scholor]

[11] Kelenc, A., Tratnik, N. and Yero, I.G., 2018. Uniquely identifying the edges of a graph: the edge metric dimension. Discrete Applied Mathematics, 251, pp.204-220.[Google Scholor]

[12] Kelenc, A., Kuziak, D., Taranenko, A. and Yero, I.G., 2017. Mixed metric dimension of graphs. Applied Mathematics and Computation, 314, pp.429-438.[Google Scholor]

[13] Sharma, S.K. and Bhat, V.K., 2021. On some plane graphs and their metric dimension. International Journal of Applied and Computational Mathematics, 7, pp.1-15.[Google Scholor]

[14] Xing, B.H., Sharma, S.K., Bhat, V.K., Raza, H. and Liu, J.B., 2021. The vertex-edge resolvability of some wheel-related graphs. Journal of Mathematics, 2021, pp.1-16.[Google Scholor]

[15] Ahsan, M., Zahid, Z., Zafar, S., Rafiq, A., Sindhu, M.S. and Umar, M., 2021. Computing the edge metric dimension of convex polytopes related graphs. Journal of Mathematics and Computer Science, 22, pp.174-188.[Google Scholor]

[16] Zhang, Y. and Gao, S., 2020. On the edge metric dimension of convex polytopes and its related graphs. Journal of Combinatorial Optimization, 39(2), pp.334-350.[Google Scholor]

Contents

Ars Combinatoria

On Vertex-Edge Resolvability for the Web Graph and Prism Related Graph

Abstract

1. Introduction

2. Mixed metric dimension:

3. Mixed Resolvability of the Prism Allied Graph $D_{n}^{t}$

4. Mixed Resolvability of the Web Graph $W_{n}$

5. Conclusion

Conflict of Interest

References:

Information

Guidelines

CP Initiatives

Follow CP

Contents

Ars Combinatoria

On Vertex-Edge Resolvability for the Web Graph and Prism Related Graph

Abstract

1. Introduction

2. Mixed metric dimension:

3. Mixed Resolvability of the Prism Allied Graph Dnt

4. Mixed Resolvability of the Web Graph Wn

5. Conclusion

Conflict of Interest

References:

Information

Guidelines

CP Initiatives

Follow CP

3. Mixed Resolvability of the Prism Allied Graph $D_{n}^{t}$

4. Mixed Resolvability of the Web Graph $W_{n}$