{'fraction_non_alphanumeric': 0.030303030303030304, 'fraction_numerical': 0.013175230566534914, 'mean_word_length': 4.205479452054795, '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}}
Broadcasting in Optimal Bipartite Double Loop Graphs

Double loop graphs are extensions of the ring topology which are obtained by regularly adding 2 extra edges per vertex. An optimal graph of diameter d has the maximum possible number of vertices. The optimal structure of double loop graphs, as well as the broadcast time and an optimal broadcast scheme are known. In this paper, we define the family of bipartite double loop graphs (BDLG) G = (V, E) where V = V0 cup V1, V0 cap V1 = phi and |V0| = |V1|. We show that the maximum number of vertices that a BDLG of diameter d can have is 2d2. We also study the broadcast problem and find that the broadcast time is d + 2. Finally we present an optimal broadcast scheme for these bipartite double loop graphs