On Mixed Metric Dimension of Rotationally Symmetric Graphs
A vertex u ∈ V(G) resolves (distinguish or recognize) two elements (vertices or edges) v, w ∈ E(G)UV(G) if d<sub>G</sub>(u, v) ≠ d<sub>G</sub>(u, w) . A subset L<sub>m</sub> of vertices in a connected graph G is called a mixed metr...
Main Authors: | Hassan Raza, Jia-Bao Liu, Shaojian Qu |
---|---|
Format: | Article |
Language: | English |
Published: |
IEEE
2020-01-01
|
Series: | IEEE Access |
Subjects: | |
Online Access: | https://ieeexplore.ieee.org/document/8937516/ |
Similar Items
-
On Mixed Metric Dimension of Some Path Related Graphs
by: Hassan Raza, et al.
Published: (2020-01-01) -
Computing the Mixed Metric Dimension of a Generalized Petersen Graph P(n, 2)
by: Hassan Raza, et al.
Published: (2020-07-01) -
On Rotationally Symmetrical Planar Networks and Their Local Fractional Metric Dimension
by: Shahbaz Ali, et al.
Published: (2023-02-01) -
Remarks on the Vertex and the Edge Metric Dimension of 2-Connected Graphs
by: Martin Knor, et al.
Published: (2022-07-01) -
Metric based resolvability of cycle related graphs
by: Ali N. A. Koam
Published: (2024-03-01)