A new lower bound on the independence number of graphs
نویسندگان
چکیده
منابع مشابه
A new lower bound on the independence number of graphs
We propose a new lower bound on the independence number of a graph. We show that our bound compares favorably to recent ones (e.g. [12]). We obtain our bound by using the Bhatia-Davis inequality applied with analytical results (minimum, maximum, expectation and variance) of an algorithm for the vertex cover problem.
متن کاملA lower bound on the independence number of a graph
For a connected and non-complete graph, a new lower bound on its independence number is proved. It is shown that this bound is realizable by the well known efficient algorithm MIN.
متن کاملA lower bound on the independence number of arbitrary hypergraphs
We present a lower bound on the independence number of arbitrary hypergraphs in terms of the degree vectors. The degree vector of a vertex v is given by d(v) = (d 1 (v); d 2 (v); : : :) where d m (v) is the number of edges of size m containing v. We deene a function f with the property that any hypergraph H = (V; E) satisses (H) P v2V f(d(v)). This lower bound is sharp when H is a matching, and...
متن کاملThe lower bound for the number of 1-factors in generalized Petersen graphs
In this paper, we investigate the number of 1-factors of a generalized Petersen graph $P(N,k)$ and get a lower bound for the number of 1-factors of $P(N,k)$ as $k$ is odd, which shows that the number of 1-factors of $P(N,k)$ is exponential in this case and confirms a conjecture due to Lovász and Plummer (Ann. New York Acad. Sci. 576(2006), no. 1, 389-398).
متن کاملA New Lower Bound on the Independence Number of a Graph and Applications
The independence number of a graph G, denoted α(G), is the maximum cardinality of an independent set of vertices in G. The independence number is one of the most fundamental and well-studied graph parameters. In this paper, we strengthen a result of Fajtlowicz [Combinatorica 4 (1984), 35–38] on the independence of a graph given its maximum degree and maximum clique size. As a consequence of our...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2013
ISSN: 0166-218X
DOI: 10.1016/j.dam.2012.10.001