An improved bound on weak independence number of a graph
| dc.contributor.author | Bhat, R.S. | |
| dc.contributor.author | Kamath, S.S. | |
| dc.contributor.author | Surekha | |
| dc.date.accessioned | 2026-02-06T06:40:04Z | |
| 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. | |
| dc.identifier.citation | Lecture Notes in Engineering and Computer Science, 2013, Vol.1 LNECS, , p. 208-210 | |
| dc.identifier.issn | 20780958 | |
| dc.identifier.uri | https://doi.org/ | |
| dc.identifier.uri | https://idr.nitk.ac.in/handle/123456789/32703 | |
| dc.subject | Weak degree | |
| dc.subject | Weak domination | |
| dc.subject | Weak independence number | |
| dc.title | An improved bound on weak independence number of a graph |