Upper signed \(k\)-domination in a general graph

DOI10.1016/J.IPL.2010.05.019zbMath1233.05145OpenAlexW2045037050MaRDI QIDQ765509

Dejan Delić, Changping Wang

Publication date: 19 March 2012

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2010.05.019

zbMATH Keywords

combinatorial problemssigned \(k\)-dominating functionminimal signed \(k\)-dominating functionupper signed \(k\)-domination number

Mathematics Subject Classification ID

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

Related Items (1)

Signed and Minus Dominating Functions in Graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Upper signed domination number
• The signed star domination numbers of the Cartesian product graphs
• A note on the lower bounds of signed domination number of a graph
• Signed total domination in graphs.
• Sparse hypercube 3-spanners
• On edge domination numbers of graphs
• Signed domination in regular graphs
• Two classes of edge domination in graphs
• On constructing \(k\)-connected \(k\)-dominating set in wireless ad hoc and sensor networks
• Signed Total Domination Nnumber of a Graph
• Lower Bounds and Algorithms for Dominating Sets in Web Graphs
• Some more remarks on domination in cubic graphs
• On signed edge domination numbers of graphs

This page was built for publication: Upper signed \(k\)-domination in a general graph