On classes of neighborhood resolving sets of a graph

B. Sooryanarayana, Suma A. S.

Abstract


Let G=(V,E) be a simple connected graph. A subset S of V is called a neighbourhood set of G if $G=\bigcup_{s\in S}<N[s]>$, where N[v] denotes the closed neighbourhood of the vertex v in G. Further for each ordered subset S={s_1,s_2, ...,s_k} of V and a vertex $u\in V$, we associate a vector $\Gamma(u/S)=(d(u,s_1),d(u,s_2), ...,d(u,s_k))$ with respect to S, where d(u,v) denote the distance between u and v in G. A subset S is said to be resolving set of G if $\Gamma(u/S)\neq \Gamma(v/S)$ for all $u,v\in V-S$. A neighbouring set of G which is also a resolving set for G is called a neighbourhood resolving set (nr-set). The purpose of this paper is to introduce various types of nr-sets and compute minimum cardinality of each set, in possible cases, particulary for paths and cycles.

Keywords


resolving set, neighbourhood set, neighbourhood resolving sets.

Full Text:

PDF

DOI: http://dx.doi.org/10.5614/ejgta.2018.6.1.3

Refbacks

  • There are currently no refbacks.


ISSN: 2338-2287

Creative Commons License
This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.

View EJGTA Stats