Every branch of mathematics employs some notion of a product that enables the com-
bination or decomposition of its elemental structures. In graph theory there are four main …

We provide several examples showing that local search, the most basic metaheuristics, may
be a very competitive choice for solving computationally hard optimization problems. In …

The semidefinite programming formulation of the Lovász theta number does not only give
one of the best polynomial simultaneous bounds on the chromatic number χ (G) or the clique …

A fundamental problem is to understand why quantum theory only violates some
noncontextuality (NC) inequalities and identify the physical principles that prevent higher …

The strong product G\boxtimes H of graphs G=(V 1, E 1) and H=(V 2, E 2) is the graph with
vertex set V (G\boxtimes H)= V_1 * V_2, where two distinct vertices (x_1, x_2),(y_1, y_2) ∈ …

We give an independent set of size 367 in the fifth strong product power of C 7, where C 7 is
the cycle on 7 vertices. This leads to an improved lower bound on the Shannon capacity of C …

Rotagraphs generalize all standard products of graphs in which one factor is a cycle. A
computer-based approach for searching graph invariants on rotagraphs is proposed and …

This article contains a construction for independent sets in the powers of the complements of
odd cycles. In particular, we show that/spl alpha/(C~/sub 2n+ 3/(2/sup n/))/spl ges/2 (2/sup …

An L (2, 1)-labeling of a graph G is an assignment of labels from {0, 1,…, λ} to the vertices of
G such that vertices at distance two get different labels and adjacent vertices get labels that …

The Shannon capacity of a graph G is defined as c (G)=\sup _ d ≥ 1 (α (G^ d))^ 1 d, c (G)=
sup d≥ 1 (α (G d)) 1 d, where α (G) α (G) is the independence number of G. The Shannon …