• THE INDEPENDENT TRANSVERSAL NEIGHBOURHOOD NUMBER OF A GRAPH

P. M. SHIVASWAMY*, N. D. SONER

Abstract


A set S of vertices in a graph G is a neighbourhood set of G if G = where is the subgraph of G induced by v and all points adjacent to v. A neighbourhood set S V of a graph G is said to be an independent transversal neighbourhood, if S intersects every maximum independent set of G. The minimum cardinality of an independent transversal neighbourhod set of G is called the independent transversal neighbourhood number of G and is denoted by ηit(G). In this paper we begin an investigation of this parameter.

Keywords


THE INDEPENDENT TRANSVERSAL NEIGHBOURHOOD NUMBER OF A GRAPH

Full Text:

PDF

Refbacks

  • There are currently no refbacks.


Creative Commons License
This work is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License.
© 2011-2019 Research Journal of Pure Algebra (RJPA)
Copyright Agreement & Authorship Responsibility
HTML Counter
Counter