An improved bound on weak independence number of a graph
| dc.contributor.author | Bhat, R.S. | |
| dc.contributor.author | Sowmya, Kamath S. | |
| dc.contributor.author | Surekha | |
| dc.date.accessioned | 2020-03-30T09:58:48Z | |
| dc.date.available | 2020-03-30T09:58:48Z | |
| dc.date.issued | 2013 | |
| dc.description.abstract | A 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.identifier.citation | Lecture Notes in Engineering and Computer Science, 2013, Vol.1 LNECS, , pp.208-210 | en_US |
| dc.identifier.uri | https://idr.nitk.ac.in/jspui/handle/123456789/7305 | |
| dc.title | An improved bound on weak independence number of a graph | en_US |
| dc.type | Book chapter | en_US |