An improved bound on weak independence number of a graph

R. S. Bhat, S. S. Kamath, Surekha

Research output: Chapter in Book/Report/Conference proceedingConference contribution

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 languageEnglish
Title of host publicationProceedings of the World Congress on Engineering 2013, WCE 2013
Pages208-210
Number of pages3
Volume1 LNECS
Publication statusPublished - 25-11-2013
Event2013 World Congress on Engineering, WCE 2013 - London, United Kingdom
Duration: 03-07-201305-07-2013

Conference

Conference2013 World Congress on Engineering, WCE 2013
CountryUnited Kingdom
CityLondon
Period03-07-1305-07-13

All Science Journal Classification (ASJC) codes

  • Computer Science (miscellaneous)

Cite this

Bhat, R. S., Kamath, S. S., & Surekha (2013). An improved bound on weak independence number of a graph. In Proceedings of the World Congress on Engineering 2013, WCE 2013 (Vol. 1 LNECS, pp. 208-210)
Bhat, R. S. ; Kamath, S. S. ; Surekha. / An improved bound on weak independence number of a graph. Proceedings of the World Congress on Engineering 2013, WCE 2013. Vol. 1 LNECS 2013. pp. 208-210
@inproceedings{596553105c5047a1a93a24ed750896a9,
title = "An improved bound on weak independence number of a graph",
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.",
author = "Bhat, {R. S.} and Kamath, {S. S.} and Surekha",
year = "2013",
month = "11",
day = "25",
language = "English",
isbn = "9789881925107",
volume = "1 LNECS",
pages = "208--210",
booktitle = "Proceedings of the World Congress on Engineering 2013, WCE 2013",

}

Bhat, RS, Kamath, SS & Surekha 2013, An improved bound on weak independence number of a graph. in Proceedings of the World Congress on Engineering 2013, WCE 2013. vol. 1 LNECS, pp. 208-210, 2013 World Congress on Engineering, WCE 2013, London, United Kingdom, 03-07-13.

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 proceedingConference 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

AN - SCOPUS:84887987710

SN - 9789881925107

VL - 1 LNECS

SP - 208

EP - 210

BT - Proceedings of the World Congress on Engineering 2013, WCE 2013

ER -

Bhat RS, Kamath SS, Surekha. An improved bound on weak independence number of a graph. In Proceedings of the World Congress on Engineering 2013, WCE 2013. Vol. 1 LNECS. 2013. p. 208-210