• Home
  • Browse
    • Current Issue
    • By Issue
    • By Author
    • By Subject
    • Author Index
    • Keyword Index
  • Journal Info
    • About Journal
    • Aims and Scope
    • Editorial Board
    • Editorial Staff
    • Publication Ethics
    • Indexing and Abstracting
    • Related Links
    • FAQ
    • Peer Review Process
    • News
  • Guide for Authors
  • Submit Manuscript
  • Reviewers
  • Contact Us
 
  • Login
  • Register
Home Articles List Article Information
  • Save Records
  • |
  • Printable Version
  • |
  • Recommend
  • |
  • How to cite Export to
    RIS EndNote BibTeX APA MLA Harvard Vancouver
  • |
  • Share Share
    CiteULike Mendeley Facebook Google LinkedIn Twitter
Journal of Algorithms and Computation
Articles in Press
Current Issue
Journal Archive
Volume Volume 51 (2019)
Volume Volume 50 (2018)
Volume Volume 49 (2017)
Volume Volume 48 (2016)
Volume Volume 47 (2016)
Volume Volume 46 (2015)
Issue Issue 1
December 2015
Volume Volume 45 (2014)
Volume Volume 44 (2013)
Volume Volume 43 (2009)
Volume Volume 42 (2008)
Volume Volume 41 (2007)
Moazzami, D. (2015). Toughness of the Networks with Maximum Connectivity. Journal of Algorithms and Computation, 46(1), 51-71.
D. Moazzami. "Toughness of the Networks with Maximum Connectivity". Journal of Algorithms and Computation, 46, 1, 2015, 51-71.
Moazzami, D. (2015). 'Toughness of the Networks with Maximum Connectivity', Journal of Algorithms and Computation, 46(1), pp. 51-71.
Moazzami, D. Toughness of the Networks with Maximum Connectivity. Journal of Algorithms and Computation, 2015; 46(1): 51-71.

Toughness of the Networks with Maximum Connectivity

Article 4, Volume 46, Issue 1, December 2015, Page 51-71  XML PDF (757.13 K)
Document Type: Research Paper
Author
D. Moazzami email
University of Tehran, College of Engineering, Department of Engineering Science
Abstract
The stability of a communication network composed of processing nodes and communication links is of prime importance to network designers. As the network begins losing links or nodes, eventually there is a loss in its effectiveness. Thus, communication networks must be constructed to be as stable as possible, not only with respect to the initial disruption, but also with respect to the possible reconstruction of the network. For any fixed integers n,p with p ≥ n + 1, Harary constructed classes of graphs Hn,p that are n-connected with the minimum number of edges. Thus Harary graphs are examples of graphs with maximum connectivity. This property makes them useful to network designers and thus it is of interest to study the behavior of other stability parameters for the Harary graphs. In this paper we study the toughness of the third case of the Harary graphs.
Keywords
toughness; Harary graph; maximum connectivity; network
Statistics
Article View: 950
PDF Download: 852
Home | Glossary | News | Aims and Scope | Sitemap
Top Top

This work is licensed under a Creative Commons Attribution 4.0 International License
Journal Management System. Designed by sinaweb.