Complexity properties of complementary prisms

DOI10.1007/s10878-015-9968-5zbMath1361.90063OpenAlexW2219063076MaRDI QIDQ511681

Uéverton dos Santos Souza, Dieter Rautenbach, Marcio Antônio Duarte, Lucia Draque Penso

Publication date: 22 February 2017

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-015-9968-5

zbMATH Keywords

independent setcliquecomplementary prism\(P_3\)-convexity\(k\)-domination

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)

Related Items

A polynomial time algorithm for geodetic hull number for complementary prisms, Open-independent, open-locating-dominating sets in complementary prism graphs, \(P_3\)-hull number of graphs with diameter two, Spectra, signless Laplacian and Laplacian spectra of complementary prisms of graphs, A general framework for path convexities, A note on the convexity number of the complementary prisms of trees, Formulas in connection with parameters related to convexity of paths on three vertices: caterpillars and unit interval graphs, Perfect matching cuts partitioning a graph into complementary subgraphs, \(P_3\)-convexity on graphs with diameter two: computing hull and interval numbers, The core of a complementary prism, The core of a vertex-transitive complementary prism, Geometric and topological properties of the complementary prism networks, On the General Position Number of Complementary Prisms, Complexity results on open-independent, open-locating-dominating sets in complementary prism graphs, Remarks on k-Clique, k-Independent Set and 2-Contamination in Complementary Prisms, Open-independent, open-locating-dominating sets: structural aspects of some classes of graphs

Cites Work

• Recognizing some complementary products
• \(k\)-tuple total domination in complementary prisms
• Irreversible conversion of graphs
• Domination and total domination in complementary prisms
• Cycles in complementary prisms
• On the Carathéodory Number for the Convexity of Paths of Order Three
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item