@article{D. Antony Xavier_M. Rosary_Andrew Arokiaraj_2014, title={Minimum Broadcast Time for Sierpinski Gasket Rhombus Graphs}, volume={2}, url={http://ijmaa.in/index.php/ijmaa/article/view/315}, abstractNote={<p>Broadcasting is a fundamental operation extensively used in various linear algebra algorithms, transitive closure algorithms, database queries and linear programming algorithms. Sierpi$\acute{n}$ski Gasket Rhombus graph is formed by identifying two copies of Sierpi$\acute{n}$ski Gasket graphs along their side edges. In this paper, we compute the broadcast time in Sierpi$\acute{n}$ski Gasket Rhombus graph when either $SR_{n,L,L}$ or $SR_{n,R,R}$ is the source node.</p>}, number={4}, journal={International Journal of Mathematics And its Applications}, author={D. Antony Xavier and M. Rosary and Andrew Arokiaraj}, year={2014}, month={Dec.}, pages={25–31} }