On the independence number of some strong products of cycle-powers

DOI10.1515/fcds-2015-0009zbMath1334.05106OpenAlexW2290022531MaRDI QIDQ275570

Marcin Jurkiewicz, Marek Kubale, Krzysztof M. Ocetkiewicz

Publication date: 26 April 2016

Published in: Foundations of Computing and Decision Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1515/fcds-2015-0009

zbMATH Keywords

independence numberShannon capacitystrong productexhaustive search algorithm

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Cyclic codes (94B15)

Related Items (1)

On zero-error codes produced by greedy algorithms

Uses Software

• NISPOC

Cites Work

• Unnamed Item
• Unnamed Item
• On the independence numbers of the cubes of odd cycles
• On the independence number of the strong product of cycle-powers
• Improved lower bound on the Shannon capacity of \(C_7\)
• On the theta number of powers of cycle graphs
• Numerical invariants and the strong product of graphs
• On the Shannon capacity of a graph
• Zero-error information theory

This page was built for publication: On the independence number of some strong products of cycle-powers