On Selkow’s Bound on the Independence Number of Graphs
For a graph G with vertex set V (G) and independence number α(G), Selkow [A Probabilistic lower bound on the independence number of graphs, Discrete Math. 132 (1994) 363–365] established the famous lower bound ∑v∈V(G)1d(v)+1(1+max{d(v)d(v)+1-∑u∈N(v)1d(u)+1,0})$\sum {_{v \in V(G)}{1 \over {d(v) + 1}}...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
University of Zielona Góra
2019-08-01
|
| Series: | Discussiones Mathematicae Graph Theory |
| Subjects: | |
| Online Access: | https://doi.org/10.7151/dmgt.2100 |