On the Edge Resolvability of Double Generalized Petersen Graphs
For a connected graph G=VG,EG, let v∈VG be a vertex and e=uw ∈EG be an edge. The distance between the vertex v and the edge e is given by dGe,v=mindGu,v,dGw,v. A vertex w∈VG distinguishes two edges e1,e2∈EG if dGw,e1≠dGw,e2. A well-known graph invariant related to resolvability of graph edges, namel...
Saved in:
| Main Authors: | , , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2022-01-01
|
| Series: | Journal of Mathematics |
| Online Access: | http://dx.doi.org/10.1155/2022/6490698 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Be the first to leave a comment!