TY - GEN
T1 - An improved bound on weak independence number of a graph
AU - Bhat, R. S.
AU - Kamath, S. S.
AU - Surekha,
PY - 2013/11/25
Y1 - 2013/11/25
N2 - 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.
AB - 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.
UR - https://www.scopus.com/pages/publications/84887987710
UR - https://www.scopus.com/pages/publications/84887987710#tab=citedBy
M3 - Conference contribution
AN - SCOPUS:84887987710
SN - 9789881925107
VL - 1 LNECS
T3 - Lecture Notes in Engineering and Computer Science
SP - 208
EP - 210
BT - Proceedings of the World Congress on Engineering 2013, WCE 2013
T2 - 2013 World Congress on Engineering, WCE 2013
Y2 - 3 July 2013 through 5 July 2013
ER -