Complexity properties of complementary prisms

DOI10.1007/S10878-015-9968-5MaRDI QIDQ511681zbMATH OpenOpenAlexFDO

Authors Marcio Antônio Duarte, Dieter Rautenbach, Uéverton dos Santos Souza, 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

cliqueindependent setcomplementary prism\(P_3\)-convexity\(k\)-domination

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)

Recommendations

• Independent domination in complementary prisms
• Cycles in complementary prisms
• Domination and total domination in complementary prisms
• The complement of the complementary prism
• A note on the convexity number for complementary prisms

Cites work

• scientific article; zbMATH DE number 1095171 (Why is no real title available?)
• scientific article; zbMATH DE number 3445275 (Why is no real title available?)
• Cycles in complementary prisms
• Domination and total domination in complementary prisms
• Double domination in complementary prisms
• Handbook of product graphs
• Independent domination in complementary prisms
• Irreversible conversion of graphs
• Locating-domination in complementary prisms
• Locating-domination in complementary prisms of paths and cycles
• On the Carathéodory number for the convexity of paths of order three
• Recognizing some complementary products
• Restrained domination in complementary prisms
• Roman domination in complementary prism graphs
• The complementary product of two graphs
• Wiener indices of generalized complementary prisms
• \(k\)-tuple total domination in complementary prisms

Cited in

(30)

• Differential in complementary prisms
• On the geodetic number of complementary prisms
• On the monophonic convexity in complementary prisms
• On the General Position Number of Complementary Prisms
• Hardness and efficiency on \(t\)-admissibility for graph operations
• Perfect matching cuts partitioning a graph into complementary subgraphs
• Open-independent, open-locating-dominating sets: structural aspects of some classes of graphs
• Cycles in complementary prisms
• Maximal independent sets in complementary prism graphs.
• The complementary product of two graphs
• Formulas in connection with parameters related to convexity of paths on three vertices: caterpillars and unit interval graphs
• Spectra, signless Laplacian and Laplacian spectra of complementary prisms of graphs
• Complexity results on \(k\)-independence in some graph products
• Geometric and topological properties of the complementary prism networks
• Independent domination in complementary prisms
• \(P_3\)-hull number of graphs with diameter two
• The automorphism group of a complementary prism
• A note on the convexity number of the complementary prisms of trees
• Remarks on \(k\)-clique, \(k\)-independent set and 2-contamination in complementary prisms
• Perfect matching cuts partitioning a graph into complementary subgraphs
• A polynomial time algorithm for geodetic hull number for complementary prisms
• The core of a complementary prism
• The core of a vertex-transitive complementary prism
• \(P_3\)-convexity on graphs with diameter two: computing hull and interval numbers
• The complement of the complementary prism
• \(k\)-independence on complementary prism graphs
• The core of a vertex transitive complementary prism of a lexicographic product
• Complexity results on open-independent, open-locating-dominating sets in complementary prism graphs
• Open-independent, open-locating-dominating sets in complementary prism graphs
• Recognizing some complementary products

This page was built for publication: Complexity properties of complementary prisms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q511681)