{'fraction_non_alphanumeric': 0.04628099173553719, 'fraction_numerical': 0.023140495867768594, 'mean_word_length': 4.17948717948718, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
New and improved results on the signed (total) k-domination number of graphs

In this paper, we study the signed k-domination and its total version in graphs. By a simple uniform approach we give some new upper and lower bounds on these two parameters of a graph in terms of several different graph parameters. In this way, we can improve and generalize some results in literature. Moreover, we make use of the well-known theorem of Turan [On an extremal problem in graph theory, Math. Fiz. Lapok 48 (1941) 436–452] to bound the signed total k-domination number, γkSt(G), of a Kr+1-free graph G for r ≥ 2.