Web图与棱柱相关图的无界混合可解性
Unbounded Mixed Resolvability of Web Graph and Prism Related Graph
摘要：
设$\mathbb{E}(H)$和$\mathbb{V}(H)$分别表示简单连通图$H$的边集和顶点集。图的混合度量维数$H$是图的不变量，它是两个重要的图参数边度量维数和度量维数的混合。本文计算了两类平面图的混合度量维数，Web图$\mathbb{W}_{n}$和Prism联盟图$\mathbb{D}_{n}^{t}$。证明了这两类平面图的混合度量维数是非常数无界的。此外，对于Web图$\mathbb{W}_{n}$和Prism联盟图$\mathbb{D}_{n}^{t}$，我们揭示了混合度量基集$M_{G}^{m}$是独立的.
英文摘要：
Let $\mathbb{E}(H)$ and $\mathbb{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 $\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.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
