Unbounded Mixed Resolvability of Web Graph and Prism Related Graph

DOI10.61091/ARS157-10MaRDI QIDQ6375574zbMATH OpenWikidataFDO

Authors S. K. Sharma, V. K. Bhat

Publication date 19 August 2021

Full work available at URL https://doi.org/10.61091/ARS157-10

Mathematics Subject Classification ID

Distance in graphs (05C12) Graph operations (line graphs, products, etc.) (05C76) Applications of graph theory (05C90)

Abstract: Let $mathbbE(H)$ and $mathbbV(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 $mathbb{W}_n$ and the Prism allied graph $mathbb{D}_n^t$. We show that the mixed metric dimension is non-constant unbounded for these two families of the plane graph. Moreover, for the Web graph $mathbb{W}_n$ and the Prism allied graph $mathbb{D}_n^t$, we unveil that the mixed metric basis set $M_G^m$ is independent.

Recommendations

• Mixed metric dimension of some plane graphs
• Mixed metric dimension of some plane graphs
• Mixed metric dimension of graphs
• The vertex-edge resolvability of some wheel-related graphs

Cited in

(3)

• Mixed metric dimension of some plane graphs
• Mixed metric dimension of some plane graphs
• On edge metric dimension of extended kayak paddle graph

This page was built for publication: Unbounded Mixed Resolvability of Web Graph and Prism Related Graph

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6375574)