Minimum Broadcast Time for Sierpinski Gasket Rhombus Graphs


Abstract views: 31 / PDF downloads: 34

Authors

  • D. Antony Xavier Department of Mathematics, Loyola College, Chennai, India
  • M. Rosary Department of Mathematics, Loyola College, Chennai, India
  • Andrew Arokiaraj Department of Mathematics, Loyola College, Chennai, India

Keywords:

Sierpi$\acute{\mathrm{n}}$ski Gasket Rhombus graph, broadcasting, broadcast time

Abstract

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.

Downloads

Published

15-12-2014

How to Cite

D. Antony Xavier, M. Rosary, & Andrew Arokiaraj. (2014). Minimum Broadcast Time for Sierpinski Gasket Rhombus Graphs. International Journal of Mathematics And Its Applications, 2(4), 25–31. Retrieved from http://ijmaa.in/index.php/ijmaa/article/view/315

Issue

Vol. 2 No. 4 (2014)

Section

Research Article

License

Creative Commons License

This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.

Most read articles by the same author(s)