Publication date
March 1994
DOI Publisher
Published by Elsevier B.V. ISSN
0012-365XAbstract
AbstractWe investigate the limiting behaviour of the independence ratio of increasing cartesian powers of a graph
AbstractWe investigate the limiting behaviour of the independence ratio of increasing cartesian powers of a graph
The independence number of a graph is the maximum number of vertices from the vertex set of the gra...
AbstractFor graphs G and H, the Cartesian product G × H is defined as follows: the vertex set is V(G...
A distance graph is an undirected graph on the integers where two integers are adjacent if their dif...
AbstractWe study the ultimate independence ratio I(G) of a graph G, defined as the limit, as k→∞, of...
AbstractWe present a greedy algorithm which leads to an improvement over Vizing's lower bound on the...
AbstractVertices of the independence graph of a graph G represent maximum independent sets of G, two...
AbstractIn this paper we study the ultimate independence ratio I(G) of a graph G, which is defined a...
Every connected graph G with radius r(G) and independence num-ber α(G) obeys α(G) ≥ r(G). Recently ...
AbstractLet n(G) denote the number of vertices of a graph G and let α(G) be the independence number ...
Every connected graph G with radius r(G) and independence number α(G) obeys α(G) ≥ r(G). Recently th...
Let G be a graph with V=VG. A nonempty subset S of V is called an independent set of G if no two dis...
The $k$-independence number of a graph, $\alpha_k(G)$, is the maximum size of a set of vertices at p...
AbstractA new lower bound on the independence number of a graph is established and an accompanying e...
AbstractThis paper is a continuation of our earlier paper under the same title. We prove that the no...
AbstractLet α(G) and χ(G) denote the independence number and chromatic number of a graph G, respecti...
The independence number of a graph is the maximum number of vertices from the vertex set of the gra...
AbstractFor graphs G and H, the Cartesian product G × H is defined as follows: the vertex set is V(G...
A distance graph is an undirected graph on the integers where two integers are adjacent if their dif...
AbstractWe study the ultimate independence ratio I(G) of a graph G, defined as the limit, as k→∞, of...
AbstractWe present a greedy algorithm which leads to an improvement over Vizing's lower bound on the...
AbstractVertices of the independence graph of a graph G represent maximum independent sets of G, two...
AbstractIn this paper we study the ultimate independence ratio I(G) of a graph G, which is defined a...
Every connected graph G with radius r(G) and independence num-ber α(G) obeys α(G) ≥ r(G). Recently ...
AbstractLet n(G) denote the number of vertices of a graph G and let α(G) be the independence number ...
Every connected graph G with radius r(G) and independence number α(G) obeys α(G) ≥ r(G). Recently th...
Let G be a graph with V=VG. A nonempty subset S of V is called an independent set of G if no two dis...
The $k$-independence number of a graph, $\alpha_k(G)$, is the maximum size of a set of vertices at p...
AbstractA new lower bound on the independence number of a graph is established and an accompanying e...
AbstractThis paper is a continuation of our earlier paper under the same title. We prove that the no...
AbstractLet α(G) and χ(G) denote the independence number and chromatic number of a graph G, respecti...
The independence number of a graph is the maximum number of vertices from the vertex set of the gra...
AbstractFor graphs G and H, the Cartesian product G × H is defined as follows: the vertex set is V(G...
A distance graph is an undirected graph on the integers where two integers are adjacent if their dif...
Add to ORKG