Upper bounds on the upper signed total domination number of graphs
From MaRDI portal
Publication:1028436
DOI10.1016/j.dam.2008.04.005zbMath1169.05368MaRDI QIDQ1028436
Cheng, T. C. Edwin, Erfang Shan
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
05C35: Extremal problems in graph theory
05C69: Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.)
05C22: Signed and weighted graphs
Related Items
On the complexity of signed and minus total domination in graphs, COMPLEXITY OF CERTAIN FUNCTIONAL VARIANTS OF TOTAL DOMINATION IN CHORDAL BIPARTITE GRAPHS
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- 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