<jats:p>A vertex <jats:inline-formula>
<math xmlns="http://www.w3.org/1998/Math/MathML" id="M1">
<mi>w</mi>
<mo>∈</mo>
<mi>V</mi>
<mfenced open="(" close=")" separators="|">
<mrow>
<mi>H</mi>
</mrow>
</mfenced>
</math>
</jats:inline-formula> distinguishes (or resolves) two elements (edges or vertices) <jats:inline-formula>
<math xmlns="http://www.w3.org/1998/Math/MathML" id="M2">
<mi>a</mi>
<mo>,</mo>
<mi>z</mi>
<mo>∈</mo>
<mi>V</mi>
<mfenced open="(" close=")" separators="|">
<mrow>
<mi>H</mi>
</mrow>
</mfenced>
<mo>∪</mo>
<mi>E</mi>
<mfenced open="(" close=")" separators="|">
<mrow>
<mi>H</mi>
</mrow>
</mfenced>
</math>
</jats:inline-formula> if <jats:inline-formula>
<math xmlns="http://www.w3.org/1998/Math/MathML" id="M3">
<mi>d</mi>
<mfenced open="(" close=")" separators="|">
<mrow>
<mi>w</mi>
<mo>,</mo>
<mi>a</mi>
</mrow>
</mfenced>
<mo>≠</mo>
<mi>d</mi>
<mfenced open="(" close=")" separators="|">
<mrow>
<mi>w</mi>
<mo>,</mo>
<mi>z</mi>
</mrow>
</mfenced>
</math>
</jats:inline-formula>. A set <jats:inline-formula>
<math xmlns="http://www.w3.org/1998/Math/MathML" id="M4">
<msub>
<mrow>
<mi>W</mi>
</mrow>
<mrow>
<mi>m</mi>
</mrow>
</msub>
</math>
</jats:inline-formula> of vertices in a nontrivial connected graph <jats:inline-formula>
<math xmlns="http://www.w3.org/1998/Math/MathML" id="M5">
<mi>H</mi>
</math>
</jats:inline-formula> is said to be a mixed resolving set for <jats:inline-formula>
<math xmlns="http://www.w3.org/1998/Math/MathML" id="M6">
<mi>H</mi>
</math>
</jats:inline-formula> if every two different elements (edges and vertices) of <jats:inline-formula>
<math xmlns="http://www.w3.org/1998/Math/MathML" id="M7">
<mi>H</mi>
</math>
</jats:inline-formula> are distinguished by at least one vertex of <jats:inline-formula>
<math xmlns="http://www.w3.org/1998/Math/MathML" id="M8">
<msub>
<mrow>
<mi>W</mi>
</mrow>
<mrow>
<mi>m</mi>
</mrow>
</msub>
</math>
</jats:inline-formula>. The mixed resolving set with minimum cardinality in <jats:inline-formula>
<math xmlns="http://www.w3.org/1998/Math/MathML" id="M9">
<mi>H</mi>
</math>
</jats:inline-formula> is called the mixed metric dimension (vertex-edge resolvability) of <jats:inline-formula>
<math xmlns="http://www.w3.org/1998/Math/MathML" id="M10">
<mi>H</mi>
</math>
</jats:inline-formula> and denoted by <jats:inline-formula>
<math xmlns="http://www.w3.org/1998/Math/MathML" id="M11">
<mi>m</mi>
<mtext> dim</mtext>
<mfenced open="(" close=")" separators="|">
<mrow>
<mi>H</mi>
</mrow>
</mfenced>
</math>
</jats:inline-formula>. The aim of this research is to determine the mixed metric dimension of some wheel graph subdivisions. We specifically analyze and compare the mixed metric, edge metric, and metric dimensions of the graphs obtained after the wheel graphs’ spoke, cycle, and barycentric subdivisions. We also prove that the mixed resolving sets for some of these graphs are independent.</jats:p>
[2]
On the Edge Metric Dimension of Different Families of Möbius Networks
,
2021,
Mathematical Problems in Engineering.
[3]
Ying Ji,et al.
Computing the Mixed Metric Dimension of a Generalized Petersen Graph P(n, 2)
,
2020,
Frontiers in Physics.
[4]
Shaojian Qu,et al.
On Mixed Metric Dimension of Rotationally Symmetric Graphs
,
2020,
IEEE Access.
[5]
Vijay Kumar Bhat,et al.
Metric dimension of heptagonal circular ladder
,
2021,
Discret. Math. Algorithms Appl..
[6]
Gary Chartrand,et al.
Resolvability in graphs and the metric dimension of a graph
,
2000,
Discret. Appl. Math..
[7]
M. Munir,et al.
Metric basis and metric dimension of 1-pentagonal carbon nanocone networks
,
2020,
Scientific Reports.
[8]
Shaojian Qu,et al.
On Mixed Metric Dimension of Some Path Related Graphs
,
2020,
IEEE Access.
[9]
Gary Chartrand,et al.
The independent resolving number of a graph
,
2003
.
[10]
Vijay Kumar Bhat,et al.
Fault-tolerant metric dimension of two-fold heptagonal-nonagonal circular ladder
,
2021
.
[11]
Muhammad Faisal Nadeem,et al.
Metric-based resolvability of polycyclic aromatic hydrocarbons
,
2021,
The European Physical Journal Plus.
[12]
M. Nadeem,et al.
The locating number of hexagonal Möbius ladder network
,
2020
.
[13]
Azriel Rosenfeld,et al.
Landmarks in Graphs
,
1996,
Discret. Appl. Math..
[14]
Ismael González Yero,et al.
Mixed metric dimension of graphs
,
2017,
Appl. Math. Comput..
[15]
Ping Zhang,et al.
The local metric dimension of a graph
,
2010
.
[16]
Ismael González Yero,et al.
Uniquely identifying the edges of a graph: The edge metric dimension
,
2018,
Discret. Appl. Math..
[17]
David R. Wood,et al.
Fault-tolerant metric dimension of graphs
,
2003
.
[18]
M. Bárta.
Abstracts
,
1984,
Brain and Language.
[19]
Pradeep Singh,et al.
Metric dimension and edge metric dimension of windmill graphs
,
2021,
AIMS Mathematics.