On the total signed domination number of the Cartesian product of paths

zbMATH Open1376.05111MaRDI QIDQ4598366FDOQ4598366

Authors:

Publication date: 20 December 2017

Recommendations

• On the total signed domination number of \(P_m\square C_n\).
• Lower bounds on the signed total \(k\)-domination number of graphs
• A lower bound on the total signed domination numbers of graphs
• scientific article; zbMATH DE number 5257358
• scientific article; zbMATH DE number 2095760

zbMATH Keywords

pathsCartesian producttotal signed domination number

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Paths and cycles (05C38) Graph operations (line graphs, products, etc.) (05C76)

Cited In (4)

• Title not available (Why is that?)
• Signed 2-independence of Cartesian product of directed paths
• On domination numbers of Cartesian products of paths
• The signed star domination numbers of the Cartesian product graphs

This page was built for publication: On the total signed domination number of the Cartesian product of paths

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