The independence number of the strong product of cycles

DOI10.1016/S0898-1221(98)00169-2zbMath0941.05046MaRDI QIDQ1125025

Aleksander Vesel

Publication date: 29 November 1999

Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)

zbMATH Keywords

independence numberchromatic numberindependent setsShannon capacitystrong products of odd cycles

Mathematics Subject Classification ID

Paths and cycles (05C38) Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (8)

The independence number of the strong product of odd cycles ⋮ On optimizing edge connectivity of product graphs ⋮ Computing graph invariants on rotagraphs using dynamic algorithm approach: The case of (2, 1)-colorings and independence numbers ⋮ On the geodetic and the hull numbers in strong product graphs ⋮ On the Shannon capacity of triangular graphs ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Improved lower bound on the Shannon capacity of \(C_7\)

Uses Software

• NISPOC

Cites Work

• The independence number of the strong product of odd cycles
• Strong products of \(\chi\)-critical graphs
• Algebraic matching theory
• Coloring graph products---a survey
• Numerical invariants and the strong product of graphs
• Analogues of the Shannon Capacity of a Graph
• A generalized measure of independence and the strong product of graphs
• On the Shannon capacity of a graph
• On a Problem of C. E. Shannon in Graph Theory
• Independence numbers of product graphs
• Independence numbers of product graphs
• Unnamed Item
• Unnamed Item

This page was built for publication: The independence number of the strong product of cycles