Share Your Research, Maximize Your Social Impacts
Broadcasting in Bloom Graph
Journal: International Journal of Mathematics and Soft Computing (Vol.6, No. 2)Publication Date: 2016.07.24
Authors : D Antony Xavier; Rosary Maria Singaraj; Elizabeth Thomas; Andrew Arokiaraj;
Page : 57-64
Keywords : Bloom graph; broadcasting; interconnection network.;
Source : Download
Find it from : Google Scholar
Abstract
Broadcasting is one of the types of global communication in interconnection networks. Broadcasting from a vertex of a graph is the simplest communication problem. In this paper, we analyse the broadcasting for bloom graph and prove that the broadcast time of bloom graph is at most two time units more than the optimal time.
Other Latest Articles
- Cordialness of arbitrary supersubdivision of graphs
- Switching of a vertex and independent domination number in graphs
- Edge regular property of cartesian product and composition of two fuzzy graphs
- Graceful and odd graceful labeling of graphs
- Hyers-Ulam stability of Cubic and Quartic Functional Equations in matrix paranormed spaces
Last modified: 2017-08-30 19:48:21