{'fraction_non_alphanumeric': 0.03992015968063872, 'fraction_numerical': 0.007984031936127744, 'mean_word_length': 4.704545454545454, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 1, '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 hamiltonicity of balanced bipartite graphs involving balanced independent set

the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. Abstract Let G be a balanced bipartite graph of order 2n and minimum degree δ(G) ≥ 5. If for every balanced independent set S of six vertices |N (S)| > n + 1, then G is Hamiltonian. It is an extension of the result of Daniel Brito and Gladys Lárez [3].