New and improved results on the signed (total) k-domination number of graphs

DOI10.1142/S1793830917500240zbMath1362.05100OpenAlexW2586454374MaRDI QIDQ5347258

Doost Ali Mojdeh, Babak Samadi

Publication date: 23 May 2017

Published in: Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s1793830917500240

zbMATH Keywords

bipartite graphopen packinglimited packingsigned total \(k\)-dominationsigned \(k\)-domination

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Signed and weighted graphs (05C22)

Related Items

Outer independent double Italian domination: Complexity, characterization, Lower bounds on the signed (total) $k$-domination number

Cites Work

• The signed \(k\)-domination number of directed graphs
• Limited packings in graphs
• Signed Total Domination Nnumber of a Graph
• On the Signed (Total) $k$-Domination Number of a Graph
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item