TY - JOUR AU - D. Antony Xavier, AU - M. Rosary, AU - Andrew Arokiaraj, PY - 2014/12/15 Y2 - 2024/03/29 TI - Minimum Broadcast Time for Sierpinski Gasket Rhombus Graphs JF - International Journal of Mathematics And its Applications JA - Int. J. Math. And Appl. VL - 2 IS - 4 SE - Research Article DO - UR - http://ijmaa.in/index.php/ijmaa/article/view/315 SP - 25-31 AB - <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> ER -