Variations of \(Y\)-dominating functions on graphs

DOI10.1016/j.disc.2007.08.080zbMath1169.05037OpenAlexW2068218174MaRDI QIDQ941347

Chuan-Min Lee, Maw-Shang Chang

Publication date: 4 September 2008

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2007.08.080

zbMATH Keywords

minus dominationsigned dominationdually chordal graphsstrongly chordal graphs\(k\)-tuple domination\(\{k\}\)-dominationdominating functions

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (16)

From Italian domination in lexicographic product graphs to w-domination in graphs ⋮ On dominating set polyhedra of circular interval graphs ⋮ Linear kernels for \(k\)-tuple and liar's domination in bounded genus graphs ⋮ On the complexity of variations of mixed domination on graphs^† ⋮ Variations of maximum-clique transversal sets on graphs ⋮ On the complexity of the labeled domination problem in graphs ⋮ Computing a minimum outer-connected dominating set for the class of chordal graphs ⋮ On complexities of minus domination ⋮ Labelled packing functions in graphs ⋮ Signed clique-transversal functions in graphs ⋮ On the complexity of signed and minus total domination in graphs ⋮ Algorithms and Complexity of Signed, Minus, and Majority Domination ⋮ Signed and Minus Dominating Functions in Graphs ⋮ New algorithms for weighted \(k\)-domination and total \(k\)-domination problems in proper interval graphs ⋮ On the complexity of \(\{k\}\)-domination and \(k\)-tuple domination in graphs ⋮ On Complexities of Minus Domination

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Dominating sets for split and bipartite graphs
• On integer domination in graphs and Vizing-like problems
• \(k\)-tuple domination in graphs
• Characterizations of strongly chordal graphs
• Neighborhood perfect graphs
• The NP-completeness of Steiner tree and dominating set for chordal bipartite graphs
• Generalized domination and efficient domination in graphs
• Minus domination in graphs
• Algorithmic aspects of majority domination
• The algorithmic use of hypertree structure and maximum neighbourhood orderings
• A disproof of Henning's conjecture on irredundance perfect graphs
• Algorithmic aspect of \(k\)-tuple domination in graphs.
• Algorithmic aspects of the generalized clique-transversal problem on chordal graphs
• The algorithmic complexity of minus domination in graphs
• Algorithmic aspects of clique-transversal and clique-independent sets
• Doubly lexical ordering of dense 0--1 matrices
• Triangulated graphs and the elimination process
• On the domination of the products of graphs II: Trees
• Three Partition Refinement Algorithms
• Dually Chordal Graphs
• Graph Classes: A Survey
• Doubly chordal graphs, steiner trees, and connected domination
• Algorithmic Aspects of Neighborhood Numbers
• Minus domination in small-degree graphs

This page was built for publication: Variations of \(Y\)-dominating functions on graphs