Pages that link to "Item:Q2555864"

The following pages link to Numerical invariants and the strong product of graphs (Q2555864):

Displaying 16 items.

• On the independence number of some strong products of cycle-powers (Q275570) (← links)
• On the independence numbers of the cubes of odd cycles (Q396806) (← links)
• A new property of the Lovász number and duality relations between graph parameters (Q516767) (← links)
• On the geodetic and the hull numbers in strong product graphs (Q630693) (← links)
• The independence number of the strong product of cycles (Q1125025) (← links)
• Modified linear dependence and the capacity of a cyclic graph (Q1241526) (← links)
• The independence number of the strong product of odd cycles (Q1379990) (← links)
• Computing graph invariants on rotagraphs using dynamic algorithm approach: The case of (2, 1)-colorings and independence numbers (Q1406039) (← links)
• Improved lower bound on the Shannon capacity of \(C_7\) (Q1847390) (← links)
• On zero-error codes produced by greedy algorithms (Q2084654) (← links)
• On the strong metric dimension of the strong products of graphs (Q2257466) (← links)
• A limit theorem for the Shannon capacities of odd cycles I (Q4417260) (← links)
• A limit theorem for the Shannon capacities of odd cycles. II (Q4825646) (← links)
• (Q5866367) (← links)
• Independence numbers of product graphs (Q5905719) (← links)
• The subset-strong product of graphs (Q6596105) (← links)