Efficient minus and signed domination in graphs

DOI10.1016/S0304-3975(02)00594-7zbMath1022.68103OpenAlexW1997494006MaRDI QIDQ1399996

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)

Related Items (4)

Upper minus total domination in small-degree regular graphs ⋮ On complexities of minus domination ⋮ Dominating functions with integer values in graphs—a survey ⋮ Algorithms and Complexity of Signed, Minus, and Majority Domination

Cites Work

• Generalized domination and efficient domination in graphs
• Polynomial algorithms for the weighted perfect domination problems on chordal graphs and split graphs
• Weighted efficient domination problem on some perfect graphs
• Weighted domination of cocomparability graphs
• Weighted independent perfect domination on cocomparability graphs
• The weighted perfect domination problem and its variants
• The algorithmic complexity of minus domination in graphs
• Graph Classes: A Survey
• A Characterization of Comparability Graphs and of Interval Graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

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