Login | Register

Broadcasting in Harary Graphs


Broadcasting in Harary Graphs

Tanna, Shreelekha (2014) Broadcasting in Harary Graphs. Masters thesis, Concordia University.

[thumbnail of Tanna_MCompSc_S2015.pdf]
Text (application/pdf)
Tanna_MCompSc_S2015.pdf - Accepted Version


With the increasing popularity of interconnection networks, efficient information dissemination has become a popular research area. Broadcasting is one of the information dissemination primitives. Broadcasting in a graph is the process of transmitting a message from one vertex, the originator, to all other vertices of the graph. We follow the classical model for broadcasting.
This thesis studies the Harary graph in depth. First, we find the diameter of Harary graph. We present an additive approximation algorithm for the broadcast problem in Harary graph. We also provide some properties for the graph like vertex transitivity, circulant graph and regularity.
In the next part we introduce modified harary graph. We calculate the diameter and broadcast time for the graph. We will also provide 1-additive approximation algorithm to find the broadcast time in the modified harary graph.

Divisions:Concordia University > Gina Cody School of Engineering and Computer Science > Computer Science and Software Engineering
Item Type:Thesis (Masters)
Authors:Tanna, Shreelekha
Institution:Concordia University
Degree Name:M. Comp. Sc.
Program:Computer Science
Date:12 December 2014
ID Code:979631
Deposited On:13 Jul 2015 14:27
Last Modified:18 Jul 2019 15:41
All items in Spectrum are protected by copyright, with all rights reserved. The use of items is governed by Spectrum's terms of access.

Repository Staff Only: item control page

Downloads per month over past year

Research related to the current document (at the CORE website)
- Research related to the current document (at the CORE website)
Back to top Back to top