ABSTRACT In this paper the independence numbers and algebraic properties of graph invariant has been discussed and studied. The graph invariant is generalization of Petersen graphs whose independence numbers have been previously known. The authors studied the bounds for the independence number of different graph invariant and sub-classes of graph invariant, and exactly determine the independence number for other graph invariant and sub-classes of graph invariant. Authors also analysed the automorphism groups of the graph invariant
AbstractA new lower bound on the independence number of a graph is established and an accompanying e...
D. Phil (Mathematics)In this thesis we investigate generalized chromatic numbers in the context of h...
AbstractAn independent set of a graph G is a set of pairwise non-adjacent vertices. G is well-covere...
We discuss in this paper the independence numbers and algebraic properties of I-graphs. The I-graphs...
In the master's thesis we are dealing with the independence number of a graph. We show, that the wel...
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 ...
Relationships between the following graph invariants are studied: The node clique cover number, θ0(\...
The independence and clique polynomial are two types of graph polynomial that store combinatorial in...
In this paper, we study the independence number of various classes of I-graphs. I-graphs are general...
In this paper we compute isolate domination number and independent domination number of some well kn...
This paper initiates a study of the connection between graph homomorphisms and the Tutte polynomial....
AbstractThree numerical invariants of graphs—the independence number, the cliquecovering number, and...
AbstractVertices of the independence graph of a graph G represent maximum independent sets of G, two...
In this thesis we consider the lower bound on a graph\u27s independence number in terms of the degre...
AbstractA new lower bound on the independence number of a graph is established and an accompanying e...
D. Phil (Mathematics)In this thesis we investigate generalized chromatic numbers in the context of h...
AbstractAn independent set of a graph G is a set of pairwise non-adjacent vertices. G is well-covere...
We discuss in this paper the independence numbers and algebraic properties of I-graphs. The I-graphs...
In the master's thesis we are dealing with the independence number of a graph. We show, that the wel...
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 ...
Relationships between the following graph invariants are studied: The node clique cover number, θ0(\...
The independence and clique polynomial are two types of graph polynomial that store combinatorial in...
In this paper, we study the independence number of various classes of I-graphs. I-graphs are general...
In this paper we compute isolate domination number and independent domination number of some well kn...
This paper initiates a study of the connection between graph homomorphisms and the Tutte polynomial....
AbstractThree numerical invariants of graphs—the independence number, the cliquecovering number, and...
AbstractVertices of the independence graph of a graph G represent maximum independent sets of G, two...
In this thesis we consider the lower bound on a graph\u27s independence number in terms of the degre...
AbstractA new lower bound on the independence number of a graph is established and an accompanying e...
D. Phil (Mathematics)In this thesis we investigate generalized chromatic numbers in the context of h...
AbstractAn independent set of a graph G is a set of pairwise non-adjacent vertices. G is well-covere...