Add to ORKGWe give an independent set of size 367 in the fifth strong product power of C7, where C7 is the cycle on 7 vertices. This leads to an improved lower bound on the Shannon capacity of C7: Θ(C7)≥3671/5>3.2578. The independent set is found by computer, using the fact that the set{t·(1,7,72,73,74)|t∈Z382}⊆Z5382 is independent in the fifth strong product power of the circular graph C108,382
AbstractHeckman and Thomas [C.C. Heckman, R. Thomas, A new proof of the independence ratio of triang...
This paper provides new observations on the Lovász θ-function of graphs. These include a simple clos...
This thesis focuses on the study of two graph parameters known as the Shannon capacity and the Lovás...
We give an independent set of size 367 in the fifth strong product power of C7, where C7 is the cycl...
AbstractWe determine the independence number of the strong product of cycle-powers Cnk and Cmp, wher...
Let G 1 × G 2 denote the strong product of graphs G 1 and G 2, that is, the graph on V(G 1) × V(G 2)...
For an undirected graph G = (V, E), let G n denote the graph whose vertex set is V n in which two di...
This thesis focuses on a problem formulated by Claude Shannon named the Shannon capacity. This probl...
The Shannon capacity problem in undirected graphs is well known [7]. This problem can be naturally g...
AbstractThe independence number of the strong product of cycles is considered in this paper. We desc...
A symmetric variant of Shannon capacity is defined and computed.Comment: 4 pages, submitted to Elect...
A slight modification of our old definition of relative Shannon capacity of a graph with respect to ...
Let Θ(G) denote the Shannon capacity of a graph G. We give an elementary proof of the equivalence, f...
AbstractA slight modification of our old definition of relative Shannon capacity of a graph with res...
AgraphG is said to be Cl-saturated if G contains no cycle of length l, but for any edge in the compl...
AbstractHeckman and Thomas [C.C. Heckman, R. Thomas, A new proof of the independence ratio of triang...
This paper provides new observations on the Lovász θ-function of graphs. These include a simple clos...
This thesis focuses on the study of two graph parameters known as the Shannon capacity and the Lovás...
We give an independent set of size 367 in the fifth strong product power of C7, where C7 is the cycl...
AbstractWe determine the independence number of the strong product of cycle-powers Cnk and Cmp, wher...
Let G 1 × G 2 denote the strong product of graphs G 1 and G 2, that is, the graph on V(G 1) × V(G 2)...
For an undirected graph G = (V, E), let G n denote the graph whose vertex set is V n in which two di...
This thesis focuses on a problem formulated by Claude Shannon named the Shannon capacity. This probl...
The Shannon capacity problem in undirected graphs is well known [7]. This problem can be naturally g...
AbstractThe independence number of the strong product of cycles is considered in this paper. We desc...
A symmetric variant of Shannon capacity is defined and computed.Comment: 4 pages, submitted to Elect...
A slight modification of our old definition of relative Shannon capacity of a graph with respect to ...
Let Θ(G) denote the Shannon capacity of a graph G. We give an elementary proof of the equivalence, f...
AbstractA slight modification of our old definition of relative Shannon capacity of a graph with res...
AgraphG is said to be Cl-saturated if G contains no cycle of length l, but for any edge in the compl...
AbstractHeckman and Thomas [C.C. Heckman, R. Thomas, A new proof of the independence ratio of triang...
This paper provides new observations on the Lovász θ-function of graphs. These include a simple clos...
This thesis focuses on the study of two graph parameters known as the Shannon capacity and the Lovás...