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
We prove that if $G=(V_G,E_G)$ is a finite, simple, and undirected graph with $\kappa$ components an...
We prove that if $G=(V_G,E_G)$ is a finite, simple, and undirected graph with $\kappa$ components an...
For a finite undirected graph G on n vertices some continuous optimization problems taken over the n...
For a connected and non-complete graph, a new lower bound on its independence number is proved. It i...
For a connected and non-complete graph, a new lower bound on its independence number is proved. It i...
We prove a new lower bound on the independence number of a simple connected graph in terms of its d...
We prove a new lower bound on the independence number of a simple connected graph in terms of its d...
We prove a new lower bound on the independence number of a simple connected graph in terms of its d...
AbstractWei discovered that the independence number of a graph G is at least Σv(1 + d(v))−1. It is p...
AbstractA new lower bound on the independence number of a graph is established and an accompanying e...
For a connected and non-complete graph, a new lower bound on its independence number is proved. It i...
AbstractFor a non-negative integer T, we prove that the independence number of a graph G=(V,E) in wh...
We prove that if $G=(V_G,E_G)$ is a finite, simple, and undirected graph with $\kappa$ components an...
AbstractAharoni, Berger and Ziv proposed a function which is a lower bound for the connectivity of t...
We prove that if $G=(V_G,E_G)$ is a finite, simple, and undirected graph with $\kappa$ components an...
We prove that if $G=(V_G,E_G)$ is a finite, simple, and undirected graph with $\kappa$ components an...
We prove that if $G=(V_G,E_G)$ is a finite, simple, and undirected graph with $\kappa$ components an...
For a finite undirected graph G on n vertices some continuous optimization problems taken over the n...
For a connected and non-complete graph, a new lower bound on its independence number is proved. It i...
For a connected and non-complete graph, a new lower bound on its independence number is proved. It i...
We prove a new lower bound on the independence number of a simple connected graph in terms of its d...
We prove a new lower bound on the independence number of a simple connected graph in terms of its d...
We prove a new lower bound on the independence number of a simple connected graph in terms of its d...
AbstractWei discovered that the independence number of a graph G is at least Σv(1 + d(v))−1. It is p...
AbstractA new lower bound on the independence number of a graph is established and an accompanying e...
For a connected and non-complete graph, a new lower bound on its independence number is proved. It i...
AbstractFor a non-negative integer T, we prove that the independence number of a graph G=(V,E) in wh...
We prove that if $G=(V_G,E_G)$ is a finite, simple, and undirected graph with $\kappa$ components an...
AbstractAharoni, Berger and Ziv proposed a function which is a lower bound for the connectivity of t...
We prove that if $G=(V_G,E_G)$ is a finite, simple, and undirected graph with $\kappa$ components an...
We prove that if $G=(V_G,E_G)$ is a finite, simple, and undirected graph with $\kappa$ components an...
We prove that if $G=(V_G,E_G)$ is a finite, simple, and undirected graph with $\kappa$ components an...
For a finite undirected graph G on n vertices some continuous optimization problems taken over the n...
DOI
Add to ORKG