1. IR@NITK
  2. 1. Faculty Publications
  3. 2. Conference Papers
Please use this identifier to cite or link to this item: https://idr.l1.nitk.ac.in/jspui/handle/123456789/7305
Full metadata record
DC FieldValueLanguage
dc.contributor.authorBhat, R.S.-
dc.contributor.authorSowmya, Kamath S.-
dc.contributor.authorSurekha-
dc.date.accessioned2020-03-30T09:58:48Z-
dc.date.available2020-03-30T09:58:48Z-
dc.date.issued2013-
dc.identifier.citationLecture Notes in Engineering and Computer Science, 2013, Vol.1 LNECS, , pp.208-210en_US
dc.identifier.urihttps://idr.nitk.ac.in/jspui/handle/123456789/7305-
dc.description.abstractA vertex v in a graph G=(V,X) is said to be weak if d(v)?d(u) for every u adjacent to v in G. A set S ? V is said to be weak if every vertex in S is a weak vertex in G. A weak set which is independent is called a weak independent set (WIS). The weak independence number w?0(G) is the maximum cardinality of a WIS. We proved that w?0(G)? p-?. This bound is further refined in this paper and we characterize the graphs for which the new bound is attained.en_US
dc.titleAn improved bound on weak independence number of a graphen_US
dc.typeBook chapteren_US
Appears in Collections:2. Conference Papers

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.