1. IR @ Gulbarga University
  2. Faculty Publications
  3. 1. Journal Articles
Please use this identifier to cite or link to this item: http://gukir.inflibnet.ac.in:8080/jspui/handle/123456789/5506
Full metadata record
DC FieldValueLanguage
dc.contributor.authorKulli, VR
dc.contributor.authorSoner, ND
dc.date.accessioned2020-06-12T15:08:06Z-
dc.date.available2020-06-12T15:08:06Z-
dc.date.issued1996
dc.identifier.citationNATIONAL ACADEMY SCIENCE LETTERS-INDIA , Vol. 19 , 44020 , p. 159 - 161en_US
dc.identifier.urihttp://gukir.inflibnet.ac.in:8080/jspui/handle/123456789/5506-
dc.description.abstractA set A of vertices in a graph G is a neighbourhood set, if G = U-v is an element of A < N [v] >, where <N [v] > is the subgraph of G induced by v and all vertices adjacent to v. A set A of vertices is independent if no two vertices in A are adjacent. The independent neighbourhood number n(i) (G) of G is the minimum number of vertices in an independent neighbourhood set of G. In this communication, bounds for n(i) (G), its exact values for some particular classes of graphs and some results concerning domination number have been found.en_US
dc.publisherNATL ACAD SCIENCES INDIA
dc.subjectgraph
dc.subjectdominating set
dc.subjectindependent set
dc.subjectneighbourhood set
dc.subjectindependent neighbourhood set
dc.titleThe independent neighbourhood number of a graphen_US
dc.typeArticle
Appears in Collections:1. Journal Articles

Files in This Item:
There are no files associated with this item.
Show simple item record


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.