V. K. Bhat

most citedOn Fault-Tolerant Resolvability of Double Antiprism and its related Graphs

1 citations · 2 across the 4 of their papers we have counts for

collaborators

5 papers

math.CO2021★ 1 cited

Multiset and Mixed Metric Dimension for Starphene and Zigzag-Edge Coronoid

Jia-Bao Liu, Sunny Kumar Sharma, Vijay Kumar Bhat +1

Let $Γ = (V, E)$ be a simple connected graph. A vertex $a$ is said to recognize (resolve) two different elements $b_{1}$ and $b_{2}$ from $V (Γ) \cup E (Γ)$ if $d(a, b_{1})\neq d(a, b_{2…

math.CO2021

Unbounded Mixed Resolvability of Web Graph and Prism Related Graph

Sunny Kumar Sharma, Vijay Kumar Bhat

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 g…

math.CO2021

Metric and Edge Metric Dimension of Zigzag Edge Coronoid Fused with Starphene

Sunny Kumar Sharma, Vijay Kumar Bhat, Hassan Raza +1

Let $Γ = (V, E)$ be a simple connected graph. $d (α, ε) = min {d (α, w), d (α, d}$ computes the distance between a vertex $α \in V (Γ)$ and an edge $ε = w d \in E (Γ)$ . A single vertex $α$ is sai…

math.CO2021

Edge Resolvability for Circular Ladder of Heptagons

Jia-Bao Liu, Sunny Kumar Sharma, Vijay Kumar Bhat +1

A set $Y$ of elements (vertices or edges) in space is said to be a $g e n er a t or$ of a metric space if each element of the space is recognized by its distances from the eleme…

math.CO2021★ 1 cited

On Fault-Tolerant Resolvability of Double Antiprism and its related Graphs

Sunny Kumar Sharma, Vijay Kumar Bhat

For a connected graph $Γ = (V, E)$ , a subset $R$ of ordered vertices in $V$ is said to be a resolving set in $Γ$ , if the vector of distances to the vertices in $R$ is unique for each…