Signed Total Domination Nnumber of a Graph
From MaRDI portal
Publication:2760957
DOI10.1023/A:1013782511179zbMath0977.05096MaRDI QIDQ2760957
Publication date: 16 December 2001
Published in: Czechoslovak Mathematical Journal (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/30630
complete bipartite graphregular graphcircuitcomplete graphCartesian product of graphssigned total domination numbersigned total dominating function
Extremal problems in graph theory (05C35) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items (34)
New bounds on the signed total domination number of graphs ⋮ Lower bounds on the signed total \(k\)-domination number of graphs ⋮ COMPLEXITY OF CERTAIN FUNCTIONAL VARIANTS OF TOTAL DOMINATION IN CHORDAL BIPARTITE GRAPHS ⋮ SIGNED TOTAL {K}-DOMINATION AND {K}-DOMATIC NUMBERS OF GRAPHS ⋮ Signed total Roman domination in graphs ⋮ An introduction to the twin signed total k-domination numbers in directed graphs ⋮ New and improved results on the signed (total) k-domination number of graphs ⋮ Upper bounds on the signed total \((k, k)\)-domatic number of graphs ⋮ On balanced cycle domination of graphs ⋮ Unnamed Item ⋮ Signed total domination in graphs. ⋮ Signed total domatic number of a graph ⋮ Remarks on the minus (signed) total domination in graphs ⋮ Upper minus total domination in small-degree regular graphs ⋮ Signed total \((k,k)\)-domatic number of digraphs ⋮ Signed total Roman domination in digraphs ⋮ Lower bounds on several versions of signed domination number ⋮ Minus total k-subdomination in graphs ⋮ Upper bounds on the signed total domatic number of graphs ⋮ Lower bounds on the signed (total) $k$-domination number ⋮ Lower negative decision number in a graph ⋮ On the complexity of signed and minus total domination in graphs ⋮ On signed majority total domination in graphs ⋮ Minus total domination in graphs ⋮ Dominating functions with integer values in graphs—a survey ⋮ Bounds on the inverse signed total domination numbers in graphs ⋮ Algorithms and Complexity of Signed, Minus, and Majority Domination ⋮ Signed and Minus Dominating Functions in Graphs ⋮ Signed (total) domination numbers and Laplacian spectrum of graphs ⋮ Upper bounds on the upper signed total domination number of graphs ⋮ Upper signed \(k\)-domination in a general graph ⋮ Signed total domination in nearly regular graphs ⋮ On the nonnegative signed domination numbers in graphs ⋮ Signed mixed dominating functions in complete bipartite graphs
Cites Work
This page was built for publication: Signed Total Domination Nnumber of a Graph
