Let G = (V,E) be a graph. A set A ⊆ V of vertices in G is called
a neighbourhood set if G =
v∈SN(v), where N(v) is the subgraph
of G induced by N[v]. The neighbourhood number η(G) of G is the
minimum cardinality of a neighbourhood set of G. A set D ⊆ V is
dominating set of G, if every vertex in V −D is adjacent to some vertex
in D. The domination number γ(G) of G is the minimum cardinality of
a dominating set. Dominating set D in a graph G is called Neighbourhood
Transversal Dominating set if it intersects every minimum neighbourhood
set. The minimum cardinality of Neighbourhood Transversal
Dominating set is called Neighbourhood Transversal Domination number
and is denoted by γnt(G). In this paper we begin an investigation
of this new parameter and some results are established.
Mathematics Subject Classification: 05C
Keywords: neighbourhood set, domination set, neighbourhood transversal
dominating set