1 citations · 3 across the 8 of their papers we have counts for
8 papers
Computational analysis of NM-polynomial based topological indices and graph-entropies of carbon nanotube Y-junctions
Sohan Lal, Vijay Kumar Bhat, Sahil Sharma
Carbon nanotube Y-junctions are of great interest to the next generation of innovative multi-terminal nanodevices. Topological indices are graph-theoretically based parameters that…
On k-distance degree based topological indices of benzenoid systems
Sohan Lal, Karnika Sharma, Vijay Kumar Bhat
Topological indices are graph invariants numeric quantities, which are utilized by researchers to analyze a variety of physiochemical aspects of molecules. The goal of developing t…
Edge Resolvability of Crystal Cubic Carbon Structure
Sahil Sharma, Vijay Kumar Bhat, Sohan Lal
Chemical graph theory is commonly used to analyse and comprehend chemical structures and networks, as well as their features. The resolvability parameters for graph = ar…
Multiset and Mixed Metric Dimension for Starphene and Zigzag-Edge Coronoid
Jia-Bao Liu, Sunny Kumar Sharma, Vijay Kumar Bhat +1
Let be a simple connected graph. A vertex is said to recognize (resolve) two different elements and from if $d(a, b_{1})\neq d(a, b_{2…
Unbounded Mixed Resolvability of Web Graph and Prism Related Graph
Sunny Kumar Sharma, Vijay Kumar Bhat
Let and denote the edge set and the vertex set of the simple connected graph , respectively. The mixed metric dimension of the graph is the g…
Metric and Edge Metric Dimension of Zigzag Edge Coronoid Fused with Starphene
Sunny Kumar Sharma, Vijay Kumar Bhat, Hassan Raza +1
Let be a simple connected graph. computes the distance between a vertex and an edge . A single vertex is sai…
Edge Resolvability for Circular Ladder of Heptagons
Jia-Bao Liu, Sunny Kumar Sharma, Vijay Kumar Bhat +1
A set of elements (vertices or edges) in space is said to be a of a metric space if each element of the space is recognized by its distances from the eleme…
On Fault-Tolerant Resolvability of Double Antiprism and its related Graphs
Sunny Kumar Sharma, Vijay Kumar Bhat
For a connected graph , a subset of ordered vertices in is said to be a resolving set in , if the vector of distances to the vertices in is unique for each…