Independence numbers of product graphs

DOI10.1016/0095-8956(74)90081-1zbMath0305.05113OpenAlexW2016567026MaRDI QIDQ5905719

Olaf Krafft, Eckart Sonnemann

Publication date: 1974

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(74)90081-1

Mathematics Subject Classification ID

Enumeration in graph theory (05C30) Graph theory (05C99)

Related Items (10)

The independence number of the strong product of odd cycles ⋮ The independence number of the strong product of cycles ⋮ Coloring graph products---a survey ⋮ On optimizing edge connectivity of product graphs ⋮ Matrix graphs and MRD codes over finite principal ideal rings ⋮ Computing graph invariants on rotagraphs using dynamic algorithm approach: The case of (2, 1)-colorings and independence numbers ⋮ On the Shannon capacity of triangular graphs ⋮ Independence numbers of product graphs ⋮ Strong products of \(\chi\)-critical graphs ⋮ Improved lower bound on the Shannon capacity of \(C_7\)

Cites Work

• Graph multiplication
• Numerical invariants and the strong product of graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Independence numbers of product graphs