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

DOI10.1142/S1793830917500240MaRDI QIDQ5347258zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• New bounds on the signed total domination number of graphs
• On the inverse signed total domination number in graphs
• Signed total \(k\)-domination in graphs.
• Lower bounds on the signed total k-domination number of graphs
• The signed \(k\)-domination numbers in graphs.

Cites work

• scientific article; zbMATH DE number 1286740 (Why is no real title available?)
• scientific article; zbMATH DE number 1792607 (Why is no real title available?)
• scientific article; zbMATH DE number 861417 (Why is no real title available?)
• scientific article; zbMATH DE number 5876397 (Why is no real title available?)
• scientific article; zbMATH DE number 2230328 (Why is no real title available?)
• scientific article; zbMATH DE number 3041944 (Why is no real title available?)
• Limited packings in graphs
• On the signed (total) \(k\)-domination number of a graph
• Signed Total Domination Nnumber of a Graph
• The signed \(k\)-domination number of directed graphs
• The signed \(k\)-domination numbers in graphs.

Cited in

(6)

• New bounds on the signed total domination number of graphs
• New bounds on the signed domination numbers of graphs
• Lower bounds on the signed (total) \(k\)-domination number
• An application of the Turán theorem to domination in graphs
• Outer independent double Italian domination: Complexity, characterization
• On the inverse signed total domination number in 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)