Complexity results on \(k\)-independence in some graph products

DOI10.1051/ro/2024098MaRDI QIDQ6594024

Julliano Rosa Nascimento, Márcia R. Cappelle, Erika M. M. Coelho, Otávio S. Mortosa

Publication date: 27 August 2024

Published in: RAIRO. Operations Research (Search for Journal in Brave)

zbMATH Keywords

independence numberCartesian product\(k\)-independent setcomplementary prism

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Graph operations (line graphs, products, etc.) (05C76)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Complexity properties of complementary prisms
• New results on \(k\)-independence of graphs
• \(k\)-domination and \(k\)-independence in graphs: A survey
• Domination and total domination in complementary prisms
• Unit disk graphs
• Independence ratios of graph powers
• On the independence graph of a graph
• On \(k\)-dependent domination
• New approach to the \(k\)-independence number of a graph
• Domination number, independent domination number and 2-independence number in trees
• k-independence stable graphs upon edge removal
• Notes on the independence number in the Cartesian product of graphs
• The Domination Number of Grids
• Maximal k-independent sets in graphs
• The <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"><mml:mi>k</mml:mi></mml:math>-independence number of graph products
• The 2-domination and Roman domination numbers of grid graphs
• Remarks on k-Clique, k-Independent Set and 2-Contamination in Complementary Prisms
• Independence numbers of product graphs
• \(k\)-independence on complementary prism graphs

This page was built for publication: Complexity results on \(k\)-independence in some graph products