Photo from wikipedia
Consider an undirected and connected graph G = ( V G , E G ) , where V G and E G represent the set of vertices and the set… Click to show full abstract
Consider an undirected and connected graph G = ( V G , E G ) , where V G and E G represent the set of vertices and the set of edges respectively. The concept of edge version of metric dimension and doubly resolving sets is based on the distances of edges in a graph. In this paper, we find the edge version of metric dimension and doubly resolving sets for the necklace graph.
Keywords:
version metric;
doubly resolving;
dimension doubly;
resolving sets;
metric dimension;
edge version
Journal Title: Mathematics
Year Published: 2018
Link to full text (if available)
Share on Social Media: Sign Up to like & get
recommendations!
Journal Title: Mathematics
Year Published: 2018
Link to full text (if available)
Share on Social Media: Sign Up to like & get
recommendations!