Numerical invariants and the strong product of graphs

DOI10.1016/0095-8956(73)90014-2zbMath0247.05122OpenAlexW2093876788MaRDI QIDQ2555864

R. Stanton Hales

Publication date: 1973

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0095-8956(73)90014-2

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Graph theory (05C99)

Related Items (15)

On the independence number of some strong products of cycle-powers ⋮ A limit theorem for the Shannon capacities of odd cycles. II ⋮ The independence number of the strong product of odd cycles ⋮ The independence number of the strong product of cycles ⋮ On the independence numbers of the cubes of odd cycles ⋮ Unnamed Item ⋮ 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 ⋮ A new property of the Lovász number and duality relations between graph parameters ⋮ On the strong metric dimension of the strong products of graphs ⋮ Independence numbers of product graphs ⋮ A limit theorem for the Shannon capacities of odd cycles I ⋮ Modified linear dependence and the capacity of a cyclic graph ⋮ On zero-error codes produced by greedy algorithms ⋮ Improved lower bound on the Shannon capacity of \(C_7\)

Cites Work

• Unnamed Item
• Ramsey bounds for graph products
• On a Problem of C. E. Shannon in Graph Theory
• Boolean Operations on Graphs.
• Chromatic Number of Cartesian Sum of Two Graphs
• Hide and Seek, Data Storage, and Entropy

This page was built for publication: Numerical invariants and the strong product of graphs