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

DOI10.1142/S1793830917500240zbMATH Open1362.05100OpenAlexW2586454374MaRDI QIDQ5347258FDOQ5347258

Doost Ali Mojdeh, B. 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

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

Cites Work

• Title not available (Why is that?)
• Signed Total Domination Nnumber of a Graph
• Title not available (Why is that?)
• Limited packings in graphs
• The signed \(k\)-domination numbers in graphs.
• Title not available (Why is that?)
• Title not available (Why is that?)
• The signed \(k\)-domination number of directed graphs
• Title not available (Why is that?)
• Title not available (Why is that?)
• On the signed (total) \(k\)-domination number of a graph

Cited In (3)

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

This page was built for publication: New and improved results on the signed (total) k-domination number of graphs

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