Complexity properties of complementary prisms

DOI10.1007/S10878-015-9968-5zbMATH Open1361.90063OpenAlexW2219063076MaRDI QIDQ511681FDOQ511681

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

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

zbMATH Keywords

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

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)

Cites Work

• Title not available (Why is that?)
• Handbook of product graphs
• On the Carathéodory number for the convexity of paths of order three
• Irreversible conversion of graphs
• Title not available (Why is that?)
• Restrained domination in complementary prisms
• Recognizing some complementary products
• \(k\)-tuple total domination in complementary prisms
• Wiener indices of generalized complementary prisms
• The complementary product of two graphs
• Domination and total domination in complementary prisms
• Cycles in complementary prisms
• Independent domination in complementary prisms
• Double domination in complementary prisms
• Locating-domination in complementary prisms
• Locating-domination in complementary prisms of paths and cycles
• Roman domination in complementary prism graphs

Cited In (29)

• 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
• Open-independent, open-locating-dominating sets: structural aspects of some classes of graphs
• Maximal independent sets in complementary prism graphs.
• The complementary product of two graphs
• Cycles in complementary prisms
• Formulas in connection with parameters related to convexity of paths on three vertices: caterpillars and unit interval graphs
• Complexity results on \(k\)-independence in some graph products
• Spectra, signless Laplacian and Laplacian spectra of complementary prisms of graphs
• 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
• Remarks on \(k\)-clique, \(k\)-independent set and 2-contamination in complementary prisms
• A note on the convexity number of the complementary prisms of trees
• A polynomial time algorithm for geodetic hull number for complementary prisms
• Perfect matching cuts partitioning a graph into complementary subgraphs
• 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
• Differential in complementary prisms
• 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)