Premium
On unreliability polynomials and graph connectivity in reliable network synthesis
Author(s) -
Boesch F. T.
Publication year - 1986
Publication title -
journal of graph theory
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.164
H-Index - 54
eISSN - 1097-0118
pISSN - 0364-9024
DOI - 10.1002/jgt.3190100311
Subject(s) - mathematics , graph , graph property , line graph , butterfly graph , discrete mathematics , combinatorics , voltage graph , theoretical computer science , computer science
The analysis and synthesis of reliable large‐scale networks typically involve a graph theoretic model. We give a survey of the graph theoretic notions which are relevant to the synthesis problem. It is shown how a number of unsolved graph extremal problems relate to the synthesis question.
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom