Efficient minus and signed domination in graphs

DOI10.1016/S0304-3975(02)00594-7MaRDI QIDQ1399996zbMATH OpenOpenAlexFDO

Authors Chin Lung Lu, Sheng-Lung Peng, Chuan Yi Tang

Publication date 30 July 2003

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0304-3975(02)00594-7

zbMATH Keywords

chordal graphsplanar bipartite graphschordal bipartite graphschain interval graphsefficient minus dominationefficient signed domination

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• scientific article; zbMATH DE number 2080250
• The algorithmic complexity of minus domination in graphs
• On the complexity of signed and minus total domination in graphs
• Minus domination in small-degree graphs
• On complexities of minus domination

Cites work

• scientific article; zbMATH DE number 3859178 (Why is no real title available?)
• scientific article; zbMATH DE number 4085682 (Why is no real title available?)
• scientific article; zbMATH DE number 91051 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 1262784 (Why is no real title available?)
• scientific article; zbMATH DE number 1095171 (Why is no real title available?)
• scientific article; zbMATH DE number 825134 (Why is no real title available?)
• scientific article; zbMATH DE number 861417 (Why is no real title available?)
• scientific article; zbMATH DE number 3311755 (Why is no real title available?)
• A Characterization of Comparability Graphs and of Interval Graphs
• Generalized domination and efficient domination in graphs
• Graph Classes: A Survey
• Polynomial algorithms for the weighted perfect domination problems on chordal graphs and split graphs
• The algorithmic complexity of minus domination in graphs
• The weighted perfect domination problem and its variants
• Weighted domination of cocomparability graphs
• Weighted efficient domination problem on some perfect graphs
• Weighted independent perfect domination on cocomparability graphs

Cited in

(10)

• Algorithms and complexity of signed, minus, and majority domination
• The algorithmic complexity of minus domination in graphs
• Algorithms and Hardness for Signed Domination
• Dominating functions with integer values in graphs—a survey
• Efficient \((j, k)\)-dominating functions
• Upper minus total domination in small-degree regular graphs
• scientific article; zbMATH DE number 2080250 (Why is no real title available?)
• Signed and minus total domination on subclasses of bipartite graphs.
• On complexities of minus domination
• On the complexity of signed and minus total domination in graphs

This page was built for publication: Efficient minus and signed domination in graphs

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