On Vertex-Edge Resolvability for the Web Graph and Prism Related Graph
Sunny Kumar Sharma, Vijay Kumar Bhat
Source 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 t n . 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 t n , we unveil that the mixed metric basis set M m G is independent.
Evidence graph
No public relationships recorded yet.
Integrity note: This page is a factual metadata record created by deterministic ingestion. It is not a claim that the work moves a mathematical frontier or has been independently verified.