Hostname: page-component-586b7cd67f-gb8f7 Total loading time: 0 Render date: 2024-11-22T19:59:28.036Z Has data issue: false hasContentIssue false
  • English
  • Français

Two-terminal series-parallel networks

Published online by Cambridge University Press:  01 July 2016

Z. A. Lomnicki
Z. A. Lomnicki*
Affiliation:
Codsall, Staffs
*
Full address: The Stone House, Oaken Lanes, Oaken, Codsall, Staffs.
Get access Rights & Permissions [Opens in a new window]

Abstract

This paper discusses two-terminal series-parallel networks occurring in Applied Probability and other contexts where the mathematical theory of reliability is developed. Eighty years ago Mac Mahon successfully discussed the number of different structures built of n identical components [1]; later Knödel [3] and Carlitz and Riordan [4] in the 1950's investigated the number of different structures built of n different components. However, in many new applications, engineers and statisticians have to study structures having n components with a specification defining various types of components and stating how many identical components of each kind should be used. This general problem is investigated in Section 7 whilst in Sections 1–6 results obtained earlier are presented and it is shown there how modern approaches to combinatorics (particularly Pólya's Enumerative Combinatorial Analysis) can simplify some reasoning of previous authors.

Keywords

TWO-TERMINAL NETWORKSSERIES-PARALLEL NETWORKSCOHERENT STRUCTURESRELIABILITY THEORYENUMERATIONENUMERATIVE COMBINATORIAL ANALYSISFIGURATE SERIES (PÓLYA)ENUMERATING SERIES (PÓLYA)CYCLE INDEX OF A PERMUTATION GROUPKRANZ GROUP (PÓLYA)DIRECT PRODUCT OF TWO GROUPS
Type
Research Article
Information
Advances in Applied Probability , Volume 4 , Issue 1 , April 1972 , pp. 109 - 150
Copyright
Copyright © Applied Probability Trust 1972 

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

[1] Mac Mahon, P. A. (1892) The combination of resistances. The Electrician 28, 601–602.Google Scholar
[2] Riordan, J. and Shannon, C. E. (1942) The number of two-terminal series-parallel networks. J. Math. and Phys. 21, 83–92.CrossRefGoogle Scholar
[3] Knödel, W. (1950) Über Zerfällungen. Monatsh. Math. LV, 20–27.Google Scholar
[4] Carlitz, L. and Riordan, J. (1956) The number of labeled two-terminal series-parallel networks. Duke Math J. 23, 435–446.CrossRefGoogle Scholar
[5] Curry, H. B. (1963) Foundations of Mathematical Logic. McGraw Hill Book Co., New York.Google Scholar
[6] Birnbaum, Z. W., Esary, J. D. and Saunders, S. C. (1961) Multicomponent systems and structures and their reliability. Technometrics V, 55–77.CrossRefGoogle Scholar
[7] Barlow, R. E. and Proschan, F. (1965) Mathematical Theory of Reliability. J. Wiley, New York.Google Scholar
[8] Riordan, J. (1958) An Introduction to Combinatorial Analysis. J. Wiley, New York.Google Scholar
[9] Pólya, G. (1937) Kombinatorische Anzahlbestimmungen für Gruppen, Graphen und Chemische Verbindungen. Acta Math. 68, 145–254.CrossRefGoogle Scholar
[10] Pólya, G. (1956) On picture writing. Amer. Math. Monthly 63, 689–697.CrossRefGoogle Scholar
[11] De Bruijn, N. G. (1964) Pólya's theory of counting. Chapter 5 in Applied Combinatorial Mathematics. Ed. Beckenbach, E. F.. J. Wiley, New York.Google Scholar
[12] Feller, W. (1957) An Introduction to Probability Theory and its Applications. Vol. 1. J. Wiley, New York.Google Scholar