On total signed vertex domination numbers in graphs

MaRDI QIDQ5399151zbMATH OpenFDO

Authors Wen-sheng Li, Hui-Xian Meng, Hua-Ming Xing

Publication date 28 February 2014

zbMATH Keywords

boundstotal signed vertex domination number

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Signed and weighted graphs (05C22)

Recommendations

• 2-signed total domination number of graphs
• On the strong signed total domination number of a graph
• On signed edge total domination numbers of graphs
• A lower bound on the total signed domination numbers of graphs
• Signed total domination number of some special graphs

Cited in

(10)

• scientific article; zbMATH DE number 5583012 (Why is no real title available?)
• scientific article; zbMATH DE number 6269006 (Why is no real title available?)
• scientific article; zbMATH DE number 5141364 (Why is no real title available?)
• 2-signed total domination number of graphs
• Signed 2-domination in caterpillars.
• scientific article; zbMATH DE number 5732576 (Why is no real title available?)
• Signed total domination number of some special graphs
• On the strong signed total domination number of a graph
• On the signed (total) \(k\)-domination number of a graph
• Vertex-edge total signed domination number of complete graph with even order

This page was built for publication: On total signed vertex domination numbers in graphs

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