Inequalities between strong, weak domination numbers and chromatic number of a graph

MaRDI QIDQ4645587zbMATH OpenFDO

Authors P. Thangaraju

Publication date 10 January 2019

zbMATH Keywords

chromatic numberdominationstrongweak domination

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Recommendations

• On strong and weak domination numbers in graphs
• Inequalities between the domination number and the chromatic number of a graph
• A note on a relation between the weak and strong domination numbers of a graph
• scientific article; zbMATH DE number 1506495
• Strong-weak domatic numbers of graphs

Cited in

(2)

• Inequalities between the domination number and the chromatic number of a graph
• First kind weak total chromatic numbers of graphs C_m F_n, C_m W_n and C_m C_n

This page was built for publication: Inequalities between strong, weak domination numbers and chromatic number of a graph

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