AbstractThis paper deals with the problem of determining the independence number for the strong graph-product, especially for odd cycles. Using the concepts of a point-symmetric graph and the clique-number and introducing the notion of an independence graph, we extend and generalize some results of Hales [3] for cycle-products of power three
AbstractAn independent set of a graph G is a set of pairwise non-adjacent vertices. G is well-covere...
AbstractVertices of the independence graph of a graph G represent maximum independent sets of G, two...
The independence number of a graph is the maximum number of vertices from the vertex set of the gra...
AbstractThis paper deals with the problem of determining the independence number for the strong grap...
AbstractThe independence number of the strong product C5⊠C7⊠C7 determined by the NISPOC software pac...
AbstractThe independence number of the strong product of cycles is considered in this paper. We desc...
AbstractThree numerical invariants of graphs—the independence number, the cliquecovering number, and...
AbstractWe determine the independence number of the strong product of cycle-powers Cnk and Cmp, wher...
The $k$-independence number of a graph, $\alpha_k(G)$, is the maximum size of a set of vertices at p...
In the master's thesis we are dealing with the independence number of a graph. We show, that the wel...
AbstractWei discovered that the independence number of a graph G is at least Σv(1 + d(v))−1. It is p...
In this paper we will consider independent sets and independent dominating sets in the strong produc...
We prove several best-possible lower bounds in terms of the order and the average degree for the ind...
Every connected graph G with radius r(G) and independence number α(G) obeys α(G) ≥ r(G). Recently th...
Every connected graph G with radius r(G) and independence num-ber α(G) obeys α(G) ≥ r(G). Recently ...
AbstractAn independent set of a graph G is a set of pairwise non-adjacent vertices. G is well-covere...
AbstractVertices of the independence graph of a graph G represent maximum independent sets of G, two...
The independence number of a graph is the maximum number of vertices from the vertex set of the gra...
AbstractThis paper deals with the problem of determining the independence number for the strong grap...
AbstractThe independence number of the strong product C5⊠C7⊠C7 determined by the NISPOC software pac...
AbstractThe independence number of the strong product of cycles is considered in this paper. We desc...
AbstractThree numerical invariants of graphs—the independence number, the cliquecovering number, and...
AbstractWe determine the independence number of the strong product of cycle-powers Cnk and Cmp, wher...
The $k$-independence number of a graph, $\alpha_k(G)$, is the maximum size of a set of vertices at p...
In the master's thesis we are dealing with the independence number of a graph. We show, that the wel...
AbstractWei discovered that the independence number of a graph G is at least Σv(1 + d(v))−1. It is p...
In this paper we will consider independent sets and independent dominating sets in the strong produc...
We prove several best-possible lower bounds in terms of the order and the average degree for the ind...
Every connected graph G with radius r(G) and independence number α(G) obeys α(G) ≥ r(G). Recently th...
Every connected graph G with radius r(G) and independence num-ber α(G) obeys α(G) ≥ r(G). Recently ...
AbstractAn independent set of a graph G is a set of pairwise non-adjacent vertices. G is well-covere...
AbstractVertices of the independence graph of a graph G represent maximum independent sets of G, two...
The independence number of a graph is the maximum number of vertices from the vertex set of the gra...
DOI
Add to ORKG