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.
| Original language | English |
|---|---|
| Title of host publication | Proceedings of the World Congress on Engineering 2013, WCE 2013 |
| Pages | 208-210 |
| Number of pages | 3 |
| Volume | 1 LNECS |
| Publication status | Published - 25-11-2013 |
| Event | 2013 World Congress on Engineering, WCE 2013 - London, United Kingdom Duration: 03-07-2013 → 05-07-2013 |
Conference
| Conference | 2013 World Congress on Engineering, WCE 2013 |
|---|---|
| Country | United Kingdom |
| City | London |
| Period | 03-07-13 → 05-07-13 |
All Science Journal Classification (ASJC) codes
- Computer Science (miscellaneous)
Cite this
}
An improved bound on weak independence number of a graph. / Bhat, R. S.; Kamath, S. S.; Surekha.
Proceedings of the World Congress on Engineering 2013, WCE 2013. Vol. 1 LNECS 2013. p. 208-210.Research output: Chapter in Book/Report/Conference proceeding › Conference contribution
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 - http://www.scopus.com/inward/record.url?scp=84887987710&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84887987710&partnerID=8YFLogxK
M3 - Conference contribution
SN - 9789881925107
VL - 1 LNECS
SP - 208
EP - 210
BT - Proceedings of the World Congress on Engineering 2013, WCE 2013
ER -