Open AccessOn 2-Resolving Sets in the Join and Corona of Graphs
Author(s) -
Jean Mansanadez Cabaro,
Helen M. Rara
Publication year - 2021
Publication title -
european journal of pure and applied mathematics
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.245
H-Index - 5
ISSN - 1307-5543
DOI - 10.29020/nybg.ejpam.v14i3.3977
Subject(s) - mathematics , metric dimension , combinatorics , join (topology) , graph , dimension (graph theory) , discrete mathematics , set (abstract data type) , dominating set , pathwidth , line graph , vertex (graph theory) , computer science , programming language
Let G be a connected graph. An ordered set of vertices {v1, ..., vl} is a 2-resolving set in G if, for any distinct vertices u, w ∈ V (G), the lists of distances (dG(u, v1), ..., dG(u, vl)) and (dG(w, v1), ..., dG(w, vl)) differ in at least 2 positions. If G has a 2-resolving set, we denote the least size of a 2-resolving set by dim2(G), the 2-metric dimension of G. A 2-resolving set of size dim2(G) is called a 2-metric basis for G. This study deals with the concept of 2-resolving set of a graph. It characterizes the 2-resolving set in the join and corona of graphs and determine theexact values of the 2-metric dimension of these graphs.