Add to ORKGIn this paper, we study the independence number of various classes of I-graphs. I-graphs are generalizations of the Generalized Petersen Graphs. We provide constructions of independent sets given any parameters, as well as bounds for some subclasses of I-graphs. We also prove exact results for some specific I-graphs.Ensign, United States NavyApproved for public release. distribution is unlimite
AbstractAn independent set Ic is a critical independent set if |Ic|−|N(Ic)|≥|J|−|N(J)|, for any inde...
AbstractAn independent set of a graph G is a set of pairwise non-adjacent vertices. G is well-covere...
The independence polynomial I(G;x) of a graph G is I(G;x)=∑k=0 α(G)skxk, where sk is the number of i...
We discuss in this paper the independence numbers and algebraic properties of I-graphs. The I-graphs...
Given a graph G, an independent set I(G) is a subset of the vertices of G such that no two vertices ...
Given a graph G, an independent set I(G) is a subset of the vertices of G such that no two vertices ...
In the master's thesis we are dealing with the independence number of a graph. We show, that the wel...
Determining the size of a maximum independent set of a graph G, denoted by alpha(G), is an NP-hard p...
Abstract. We consider the number of vertex independent sets i(G). In general, the problem of determi...
We consider the number of vertex independent sets i(G)In general, the problem of determining the val...
Abstract. An independent set Ic is a critical independent set if |Ic|−|N(Ic) | ≥ |J | − |N(J)|, for...
Abstract. The independence polynomial of a graph G is the polynomial ikx k, where ik denote the numb...
Settling Kahn's conjecture (2001), we prove the following upper bound on the number i(G) of independ...
AbstractNew upper bounds for the number of independent sets in graphs are obtained
The independence polynomial I(G;x) of a graph G is I(G;x)=∑k=0 α(G)skxk, where sk is the number of i...
AbstractAn independent set Ic is a critical independent set if |Ic|−|N(Ic)|≥|J|−|N(J)|, for any inde...
AbstractAn independent set of a graph G is a set of pairwise non-adjacent vertices. G is well-covere...
The independence polynomial I(G;x) of a graph G is I(G;x)=∑k=0 α(G)skxk, where sk is the number of i...
We discuss in this paper the independence numbers and algebraic properties of I-graphs. The I-graphs...
Given a graph G, an independent set I(G) is a subset of the vertices of G such that no two vertices ...
Given a graph G, an independent set I(G) is a subset of the vertices of G such that no two vertices ...
In the master's thesis we are dealing with the independence number of a graph. We show, that the wel...
Determining the size of a maximum independent set of a graph G, denoted by alpha(G), is an NP-hard p...
Abstract. We consider the number of vertex independent sets i(G). In general, the problem of determi...
We consider the number of vertex independent sets i(G)In general, the problem of determining the val...
Abstract. An independent set Ic is a critical independent set if |Ic|−|N(Ic) | ≥ |J | − |N(J)|, for...
Abstract. The independence polynomial of a graph G is the polynomial ikx k, where ik denote the numb...
Settling Kahn's conjecture (2001), we prove the following upper bound on the number i(G) of independ...
AbstractNew upper bounds for the number of independent sets in graphs are obtained
The independence polynomial I(G;x) of a graph G is I(G;x)=∑k=0 α(G)skxk, where sk is the number of i...
AbstractAn independent set Ic is a critical independent set if |Ic|−|N(Ic)|≥|J|−|N(J)|, for any inde...
AbstractAn independent set of a graph G is a set of pairwise non-adjacent vertices. G is well-covere...
The independence polynomial I(G;x) of a graph G is I(G;x)=∑k=0 α(G)skxk, where sk is the number of i...