# On strong (weak) independent sets and vertex coverings of a graph

S. S. Kamath, R. S. Bhat

Research output: Contribution to journalArticle

15 Citations (Scopus)

### Abstract

A vertex v in a graph G = (V, E) is strong (weak) if deg (v) ≥ deg (u)(deg (v) ≤ deg (u)) for every u adjacent to v in G. A set S ⊆ V is said to be strong (weak) if every vertex in S is a strong (weak) vertex in G. A strong (weak) set which is independent is called a strong independent set [SIS] (weak independent set [WIS]). The strong (weak) independence numbers α = s α (G) (w α = w α (G)) is the maximum cardinality of an SIS (WIS). For an edge x = uv, v strongly covers the edge x if deg (v) ≥ deg (u) in G. Then u weakly covers x. A set S ⊆ V is a strong vertex cover [SVC] (weak vertex cover [WVC]) if every edge in G is strongly (weakly) covered by some vertex in S. The strong (weak) vertex covering numbers β = s β (G)(w β = w β (G)) is the minimum cardinality of an SVC (WVC). In this paper, we investigate some relationships among these four new parameters. For any graph G without isolated vertices, we show that the following inequality chains hold: s α ≤ β ≤ s β ≤ w β and s α ≤ w α ≤ α ≤ w β. Analogous to Gallai's theorem, we prove s β + w α = p and w β + s α = p. Further, we show that s α ≤ p - Δ and w α ≤ p - δ and find a necessary and sufficient condition to attain the upper bound, characterizing the graphs which attain these bounds. Several Nordhaus-Gaddum-type results and a Vizing-type result are also established.

Original language English 1136-1145 10 Discrete Mathematics 307 9-10 https://doi.org/10.1016/j.disc.2006.07.040 Published - 06-05-2007

### Fingerprint

Independent Set
Covering
Graph in graph theory
Vertex of a graph
Vertex Cover
Cardinality
Cover
Covering number
Independence number
Upper bound
Necessary Conditions
Sufficient Conditions

### All Science Journal Classification (ASJC) codes

• Discrete Mathematics and Combinatorics
• Theoretical Computer Science

### Cite this

Kamath, S. S. ; Bhat, R. S. / On strong (weak) independent sets and vertex coverings of a graph. In: Discrete Mathematics. 2007 ; Vol. 307, No. 9-10. pp. 1136-1145.
@article{9b6e86d2fdde4d3eaed921d567f47a3b,
title = "On strong (weak) independent sets and vertex coverings of a graph",
abstract = "A vertex v in a graph G = (V, E) is strong (weak) if deg (v) ≥ deg (u)(deg (v) ≤ deg (u)) for every u adjacent to v in G. A set S ⊆ V is said to be strong (weak) if every vertex in S is a strong (weak) vertex in G. A strong (weak) set which is independent is called a strong independent set [SIS] (weak independent set [WIS]). The strong (weak) independence numbers α = s α (G) (w α = w α (G)) is the maximum cardinality of an SIS (WIS). For an edge x = uv, v strongly covers the edge x if deg (v) ≥ deg (u) in G. Then u weakly covers x. A set S ⊆ V is a strong vertex cover [SVC] (weak vertex cover [WVC]) if every edge in G is strongly (weakly) covered by some vertex in S. The strong (weak) vertex covering numbers β = s β (G)(w β = w β (G)) is the minimum cardinality of an SVC (WVC). In this paper, we investigate some relationships among these four new parameters. For any graph G without isolated vertices, we show that the following inequality chains hold: s α ≤ β ≤ s β ≤ w β and s α ≤ w α ≤ α ≤ w β. Analogous to Gallai's theorem, we prove s β + w α = p and w β + s α = p. Further, we show that s α ≤ p - Δ and w α ≤ p - δ and find a necessary and sufficient condition to attain the upper bound, characterizing the graphs which attain these bounds. Several Nordhaus-Gaddum-type results and a Vizing-type result are also established.",
author = "Kamath, {S. S.} and Bhat, {R. S.}",
year = "2007",
month = "5",
day = "6",
doi = "10.1016/j.disc.2006.07.040",
language = "English",
volume = "307",
pages = "1136--1145",
journal = "Discrete Mathematics",
issn = "0012-365X",
publisher = "Elsevier",
number = "9-10",

}

On strong (weak) independent sets and vertex coverings of a graph. / Kamath, S. S.; Bhat, R. S.

In: Discrete Mathematics, Vol. 307, No. 9-10, 06.05.2007, p. 1136-1145.

Research output: Contribution to journalArticle

TY - JOUR

T1 - On strong (weak) independent sets and vertex coverings of a graph

AU - Kamath, S. S.

AU - Bhat, R. S.

PY - 2007/5/6

Y1 - 2007/5/6

N2 - A vertex v in a graph G = (V, E) is strong (weak) if deg (v) ≥ deg (u)(deg (v) ≤ deg (u)) for every u adjacent to v in G. A set S ⊆ V is said to be strong (weak) if every vertex in S is a strong (weak) vertex in G. A strong (weak) set which is independent is called a strong independent set [SIS] (weak independent set [WIS]). The strong (weak) independence numbers α = s α (G) (w α = w α (G)) is the maximum cardinality of an SIS (WIS). For an edge x = uv, v strongly covers the edge x if deg (v) ≥ deg (u) in G. Then u weakly covers x. A set S ⊆ V is a strong vertex cover [SVC] (weak vertex cover [WVC]) if every edge in G is strongly (weakly) covered by some vertex in S. The strong (weak) vertex covering numbers β = s β (G)(w β = w β (G)) is the minimum cardinality of an SVC (WVC). In this paper, we investigate some relationships among these four new parameters. For any graph G without isolated vertices, we show that the following inequality chains hold: s α ≤ β ≤ s β ≤ w β and s α ≤ w α ≤ α ≤ w β. Analogous to Gallai's theorem, we prove s β + w α = p and w β + s α = p. Further, we show that s α ≤ p - Δ and w α ≤ p - δ and find a necessary and sufficient condition to attain the upper bound, characterizing the graphs which attain these bounds. Several Nordhaus-Gaddum-type results and a Vizing-type result are also established.

AB - A vertex v in a graph G = (V, E) is strong (weak) if deg (v) ≥ deg (u)(deg (v) ≤ deg (u)) for every u adjacent to v in G. A set S ⊆ V is said to be strong (weak) if every vertex in S is a strong (weak) vertex in G. A strong (weak) set which is independent is called a strong independent set [SIS] (weak independent set [WIS]). The strong (weak) independence numbers α = s α (G) (w α = w α (G)) is the maximum cardinality of an SIS (WIS). For an edge x = uv, v strongly covers the edge x if deg (v) ≥ deg (u) in G. Then u weakly covers x. A set S ⊆ V is a strong vertex cover [SVC] (weak vertex cover [WVC]) if every edge in G is strongly (weakly) covered by some vertex in S. The strong (weak) vertex covering numbers β = s β (G)(w β = w β (G)) is the minimum cardinality of an SVC (WVC). In this paper, we investigate some relationships among these four new parameters. For any graph G without isolated vertices, we show that the following inequality chains hold: s α ≤ β ≤ s β ≤ w β and s α ≤ w α ≤ α ≤ w β. Analogous to Gallai's theorem, we prove s β + w α = p and w β + s α = p. Further, we show that s α ≤ p - Δ and w α ≤ p - δ and find a necessary and sufficient condition to attain the upper bound, characterizing the graphs which attain these bounds. Several Nordhaus-Gaddum-type results and a Vizing-type result are also established.

UR - http://www.scopus.com/inward/record.url?scp=33846817097&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=33846817097&partnerID=8YFLogxK

U2 - 10.1016/j.disc.2006.07.040

DO - 10.1016/j.disc.2006.07.040

M3 - Article

AN - SCOPUS:33846817097

VL - 307

SP - 1136

EP - 1145

JO - Discrete Mathematics

JF - Discrete Mathematics

SN - 0012-365X

IS - 9-10

ER -