Skip to main content
SpringerLink
Log in

A New Construction of Broadcast Graphs

  • Conference paper
Algorithms and Discrete Applied Mathematics (CALDAM 2016)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 9602))

Included in the following conference series:

Abstract

Given a graph \(G=(V,E)\) and an originator vertex v, broadcasting is an information disseminating process of transmitting a message from vertex v to all vertices of graph G as quickly as possible. A graph G on n vertices is called broadcast graph if the broadcasting from any vertex in the graph can be accomplished in \(\lceil \log n\rceil \) time. A broadcast graph with the minimum number of edges is called minimum broadcast graphs. The number of edges in a minimum broadcast graph on n vertices is denoted by B(n). A long sequence of papers present different techniques to construct broadcast graphs and to obtain upper bounds on B(n). In this paper, we follow the compounding method to construct new broadcast graphs and improve the known upper bounds on B(n) for many values of n.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Averbuch, A., Shabtai, R.H., Roditty, Y.: Efficient construction of broadcast graphs. Discrete Appl. Math. 171, 9–14 (2014)

    Article  MathSciNet  MATH  Google Scholar 

  2. Barsky, G., Grigoryan, H., Harutyunyan, H.A.: Tight lower bounds on broadcast function for n=24 and 25. Discrete Appl. Math. 175, 109–114 (2014)

    Article  MathSciNet  MATH  Google Scholar 

  3. Bermond, J.C., Fraigniaud, P., Peters, J.G.: Antepenultimate broadcasting. Networks 26, 125–137 (1995)

    Article  MathSciNet  MATH  Google Scholar 

  4. Bermond, J.C., Harutyunyan, H.A., Liestman, A.L., Perennes, S.: A note on the dimensionality of modified Knödel graphs. Int. J. Found. Comput. Sci. 8(02), 109–116 (1997)

    Article  MATH  Google Scholar 

  5. Bermond, J.C., Hell, P., Liestman, A.L., Peters, J.G.: Sparse broadcast graphs. Discrete Appl. Math. 36, 97–130 (1992)

    Article  MathSciNet  MATH  Google Scholar 

  6. Chau, S.C., Liestman, A.L.: Constructing minimal broadcast networks. J. Combin. Inform. Syst. Sci 10, 110–122 (1985)

    MathSciNet  MATH  Google Scholar 

  7. Dineen, M.J., Fellows, M.R., Faber, V.: Algebraic constructions of efficient broadcast networks. In: Proceedings of the 9th International Symposium on Applied Algebra, Algebraic Algorithms and Error Correcting Codes, pp. 152–158 (1991)

    Google Scholar 

  8. Dinneen, M.J., Ventura, J.A., Wilson, M.C., Zakeri, G.: Compound constructions of broadcast networks. Discrete Appl. Math. 93, 205–232 (1999)

    Article  MathSciNet  MATH  Google Scholar 

  9. Farley, A., Hedetniemi, S., Mitchell, S., Proskurowski, A.: Minimum broadcast graphs. Discrete Math. 25, 189–193 (1979)

    Article  MathSciNet  MATH  Google Scholar 

  10. Farley, A.M.: Minimal broadcast networks. Networks 9, 313–332 (1979)

    Article  MathSciNet  MATH  Google Scholar 

  11. Fertin, G., Raspaud, A.: A survey on Knödel graphs. Discrete Appl. Math. 137, 173–195 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  12. Gargano, L., Vaccaro, U.: On the construction of minimal broadcast networks. Networks 19, 673–689 (1989)

    Article  MathSciNet  MATH  Google Scholar 

  13. Grigni, M., Peleg, D.: Tight bounds on mimimum broadcast networks. SIAM J. Discrete Math. 4, 207–222 (1991)

    Article  MathSciNet  MATH  Google Scholar 

  14. Grigoryan, H., Harutyunyan, H.A.: New lower bounds on broadcast function. In: Gu, Q., Hell, P., Yang, B. (eds.) AAIM 2014. LNCS, vol. 8546, pp. 174–184. Springer, Heidelberg (2014)

    Google Scholar 

  15. Harutyunyan, H.A.: An efficient vertex addition method for broadcast networks. Internet Math. 5(3), 197–211 (2009)

    MathSciNet  Google Scholar 

  16. Harutyunyan, H.A., Liestman, A.L.: More broadcast graphs. Discrete Appl. Math. 98, 81–102 (1999)

    Article  MathSciNet  MATH  Google Scholar 

  17. Harutyunyan, H.A., Liestman, A.L.: Upper bounds on the broadcast function using minimum dominating sets. Discrete Math. 312, 2992–2996 (2012)

    Article  MathSciNet  MATH  Google Scholar 

  18. Khachatrian, L., Harutounian, O.: Construction of new classes of minimal broadcast networks. In: Conference on Coding Theory, Dilijan, Armenia, pp. 69–77 (1990)

    Google Scholar 

  19. Knödel, W.: Note new gossips and telephones. Discrete Math. 13, 95 (1975)

    Article  MathSciNet  MATH  Google Scholar 

  20. König, J.C., Lazard, E.: Minimum k-broadcast graphs. Discrete Appl. Math. 53, 199–209 (1994)

    Article  MathSciNet  MATH  Google Scholar 

  21. Labahn, R.: A minimum broadcast graph on 63 vertices. Discrete Appl. Math. 53, 247–250 (1994)

    Article  MathSciNet  MATH  Google Scholar 

  22. Maheo, M., Saclé, J.F.: Some minimum broadcast graphs. Discrete Appl. Math. 53, 275–285 (1994)

    Article  MathSciNet  MATH  Google Scholar 

  23. Mitchell, S., Hedetniemi, S.: A census of minimum broadcast graphs. J. Combin. Inform. System Sci 5, 141–151 (1980)

    MathSciNet  MATH  Google Scholar 

  24. Park, J.H., Chwa, K.Y.: Recursive circulant: a new topology for multicomputer networks. In: International Symposium on Parallel Architectures, Algorithms and Networks (ISPAN 1994), pp. 73–80. IEEE (1994)

    Google Scholar 

  25. Saclé, J.F.: Lower bounds for the size in four families of minimum broadcast graphs. Discrete Math. 150, 359–369 (1996)

    Article  MathSciNet  MATH  Google Scholar 

  26. Shao, B.: On K-broadcasting in Graphs. Ph.D. thesis, Concordia University (2006)

    Google Scholar 

  27. Ventura, J.A., Weng, X.: A new method for constructing minimal broadcast networks. Networks 23, 481–497 (1993)

    Article  MathSciNet  MATH  Google Scholar 

  28. Weng, M.X., Ventura, J.A.: A doubling procedure for constructing minimal broadcast networks. Telecommun. Syst. 3, 259–293 (1994)

    Article  Google Scholar 

  29. Xiao, J., Wang, X.: A research on minimum broadcast graphs. Chinese J. Comput. 11, 99–105 (1988)

    Google Scholar 

  30. Zhou, J.G., Zhang, K.M.: A minimum broadcast graph on 26 vertices. Appl. Math. Lett. 14, 1023–1026 (2001)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science and Software Engineering, Concordia University, Montreal, QC, H3G 1M8, Canada

    Hovhannes A. Harutyunyan & Zhiyuan Li

Authors
  1. Hovhannes A. Harutyunyan
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Zhiyuan Li
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Zhiyuan Li .

Editor information

Editors and Affiliations

  1. Indian Institute of Science, Bangalore, India

    Sathish Govindarajan

  2. Carleton University, Ottawa, ON, Canada

    Anil Maheshwari

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer International Publishing Switzerland

About this paper

Cite this paper

Harutyunyan, H.A., Li, Z. (2016). A New Construction of Broadcast Graphs. In: Govindarajan, S., Maheshwari, A. (eds) Algorithms and Discrete Applied Mathematics. CALDAM 2016. Lecture Notes in Computer Science(), vol 9602. Springer, Cham. https://doi.org/10.1007/978-3-319-29221-2_17

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-29221-2_17

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-29220-5

  • Online ISBN: 978-3-319-29221-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation