Upper bounds on the upper signed total domination number of graphs

DOI10.1016/J.DAM.2008.04.005zbMath1169.05368OpenAlexW2015837941MaRDI QIDQ1028436

Erfang Shan, Cheng, T. C. Edwin

Publication date: 30 June 2009

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2008.04.005

zbMATH Keywords

upper bounddominating functionupper signed total domination number

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Signed and weighted graphs (05C22)

Related Items (3)

COMPLEXITY OF CERTAIN FUNCTIONAL VARIANTS OF TOTAL DOMINATION IN CHORDAL BIPARTITE GRAPHS ⋮ On the complexity of signed and minus total domination in graphs ⋮ Signed and Minus Dominating Functions in Graphs

Cites Work

• Signed domination in regular graphs and set-systems
• Signed total domination in graphs.
• Upper minus total domination in small-degree regular graphs
• Total minus domination in \(k\)-partite graphs
• Signed Total Domination Nnumber of a Graph
• Total domination in graphs
• Dominating functions with integer values in graphs—a survey
• Signed total domination in nearly regular graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Upper bounds on the upper signed total domination number of graphs