{'fraction_non_alphanumeric': 0.028077753779697623, 'fraction_numerical': 0.0, 'mean_word_length': 4.8, '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}}
The Independence Number for the Generalized Petersen Graphs

Abstract : Given a graph G, an independent set I(G) is a subset of the vertices of G such that no two vertices in I(G) are adjacent. The independence number alpha(G) is the order of the largest set of independent vertices. In this paper, we study the independence number for the Generalized Petersen graphs, finding both sharp bounds and exact results for subclasses of the Generalized Petersen graphs.