Add to ORKGIn this thesis we consider the lower bound on a graph\u27s independence number in terms of the degree sequence of the graph. We present three functions of the degree sequence which are known lower bounds on independence number and compare them. We show that one of these functions, the residue, is often best possible. We determine explicitly the best possible lower bound on independence number of graphs realizing a given semi-regular degree sequence
In the master's thesis we are dealing with the independence number of a graph. We show, that the wel...
AbstractAharoni, Berger and Ziv proposed a function which is a lower bound for the connectivity of t...
We study the relationship between the independence number of a graph and its semidenite relaxation ...
In this thesis we consider the lower bound on a graph\u27s independence number in terms of the degre...
In this thesis we consider the lower bound on a graph\u27s independence number in terms of the degre...
AbstractMany functions of the degree sequence of a graph give lower bounds on the graph's independen...
For a connected and non-complete graph, a new lower bound on its independence number is proved. It i...
AbstractWe prove a new lower bound on the independence number of a simple connected graph in terms o...
Let G be a graph with degree sequence (d v). If the maximum degree of any subgraph induced by a neig...
AbstractWei discovered that the independence number of a graph G is at least Σv(1 + d(v))−1. It is p...
Favaron et al. proved that the residue of a simple graph G is a lower bound on its independence numb...
The independence number of a graph G, denoted (G), is the maximum cardi- nality of an independent ...
AbstractA new lower bound on the independence number of a graph is established and an accompanying e...
AbstractWei discovered that the independence number of a graph G is at least Σv(1 + d(v))−1. It is p...
Strengthening the well-known Caro-Wei bound, Favaron et al. proved that the residue of a simple grap...
In the master's thesis we are dealing with the independence number of a graph. We show, that the wel...
AbstractAharoni, Berger and Ziv proposed a function which is a lower bound for the connectivity of t...
We study the relationship between the independence number of a graph and its semidenite relaxation ...
In this thesis we consider the lower bound on a graph\u27s independence number in terms of the degre...
In this thesis we consider the lower bound on a graph\u27s independence number in terms of the degre...
AbstractMany functions of the degree sequence of a graph give lower bounds on the graph's independen...
For a connected and non-complete graph, a new lower bound on its independence number is proved. It i...
AbstractWe prove a new lower bound on the independence number of a simple connected graph in terms o...
Let G be a graph with degree sequence (d v). If the maximum degree of any subgraph induced by a neig...
AbstractWei discovered that the independence number of a graph G is at least Σv(1 + d(v))−1. It is p...
Favaron et al. proved that the residue of a simple graph G is a lower bound on its independence numb...
The independence number of a graph G, denoted (G), is the maximum cardi- nality of an independent ...
AbstractA new lower bound on the independence number of a graph is established and an accompanying e...
AbstractWei discovered that the independence number of a graph G is at least Σv(1 + d(v))−1. It is p...
Strengthening the well-known Caro-Wei bound, Favaron et al. proved that the residue of a simple grap...
In the master's thesis we are dealing with the independence number of a graph. We show, that the wel...
AbstractAharoni, Berger and Ziv proposed a function which is a lower bound for the connectivity of t...
We study the relationship between the independence number of a graph and its semidenite relaxation ...