Classes of Planar Graphs with Constant Edge Metric Dimension
The number of edges in a shortest walk (without repetition of vertices) from one vertex to another vertex of a connected graph G is known as the distance between them. For a vertex x and an edge e=ab in G, the minimum number from distances of x with a and b is said to be the distance between x and e...
Saved in:
| Main Authors: | , , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2021-01-01
|
| Series: | Complexity |
| Online Access: | http://dx.doi.org/10.1155/2021/5599274 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|