Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: 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 ll as the broadcast time and an optimal broadcast scheme are known. ,  define the family of bipartite double loop graphs (BDLG) G = (V, E) where V = V 0  cup V 1 , V 0  cap V 1  = phi and |V 0 | = |V 1 |.  show that the maximum number of vertices that a BDLG of diameter d can have is 2d 2 .  also study the broadcast problem and find that the broadcast time is d + 2. Finally  present an optimal broadcast scheme for these bipartite double loop graphs
['Hovhannes A. Harutyunyan', 'Edward Maraachlian']
I am writing a research paper on a idea Broadcasting in Optimal Bipartite Double Loop Graphs
[{"from": "human", "value": "I am writing a research paper on a idea Broadcasting in Optimal Bipartite Double Loop Graphs"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: 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 ll as the broadcast time and an optimal broadcast scheme are known. ,  define the family of bipartite double loop graphs (BDLG) G = (V, E) where V = V 0  cup V 1 , V 0  cap V 1  = phi and |V 0 | = |V 1 |.  show that the maximum number of vertices that a BDLG of diameter d can have is 2d 2 .  also study the broadcast problem and find that the broadcast time is d + 2. Finally  present an optimal broadcast scheme for these bipartite double loop graphs"}]