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 on α (G), where N(v) and d(v) = |N(v)| denote the neighborhood and the degree of a vertex v ∈ V (G), respectively. However, Selkow’s original proof of this result is incorrect. We give a new probabilistic proof of Selkow’s bound here.
SCImago Journal Rank (SJR) 2018: 0.763 Source Normalized Impact per Paper (SNIP) 2018: 0.934
Mathematical Citation Quotient (MCQ) 2017: 0.36
researchers in the fields of: colourings, partitions (general colourings), hereditary properties, independence and dominating structures (sets, paths, cycles, etc.), cycles, local properties, products of graphs