{'fraction_non_alphanumeric': 0.050445103857566766, 'fraction_numerical': 0.00741839762611276, 'mean_word_length': 4.232558139534884, '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}}
Independence and global offensive alliance in graphs

Let G be a simple graph with vertex set V (G). A non-empty set S ⊆ V (G) is a global strong offensive alliance if for every vertex v in V (G)−S, a strict majority of its closed neighborhood is in S. The global strong offensive alliance number γo(G) is the minimum cardinality of a global strong offensive alliance of G. We show that if G is a connected bipartite graph of order at least three, then γo(G) ≤ 32α(G) and if G is a connected unicyclic graph, then γo(G) ≤ 32α(G) + 1, where α(G) is the independence number of G. Moreover, we characterize extremal bipartite graphs achieving equality in the first upper bound.