On the design of reliable networks

descriptionPublicationkeyboard_double_arrow_right Article 01 Jan 1973 English Publisher:WileyJournal:Networks, volume 3, pages 241-260 (issn: 0028-3045, eissn: 1097-0037,

Copyright policy )

Authors: S. Louis Hakimi; Ashok T. Amin;

doi: 10.1002/net.3230030304

On the design of reliable networks

- Summary
- Subjects
- Metrics

Abstract

AbstractThis paper is concerned with construction of graphs, with n vertices and m edges, whose connectivity r = [2m/n] ≧ 3, and have no more than n minimum vertex cut‐sets. Frank's results imply that this is an important step in the design of a class of reliable networks.

Related Organizations

Northwestern University
United States
NORTHWESTERN UNIVERSITY
United States

Keywords

Graph theory, Extremal problems in graph theory, Switching theory, application of Boolean algebra; Boolean functions

Impact byBIP!

	selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	23
	popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.	Average
	influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	Top 1%
	impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.	Average