The comparative study of resolving parameters for a family of ladder networks
For a simple connected graph $ G = (V, E) $, a vertex $ x\in V $ distinguishes two elements (vertices or edges) $ x_1\in V, y_1 \in E $ if $ d(x, x_1)\neq d(x, y_1). $ A subset $ Q_m\subset V $ is a mixed metric generator for $ G, $ if every two distinct elements (vertices or edges) of $ G $ are dis...
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
AIMS Press
2022-07-01
|
| Series: | AIMS Mathematics |
| Subjects: | |
| Online Access: | https://www.aimspress.com/article/doi/10.3934/math.2022908?viewType=HTML |