On unreliability polynomials and graph connectivity in reliable network synthesis (Q3478240): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Super Line-Connectivity Properties of Circulant Graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Maximizing the total number of spanning trees in a graph: two related problems in graph theory and optimum design theory / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4044620 / rank | |||
Normal rank | |||
Revision as of 14:48, 20 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On unreliability polynomials and graph connectivity in reliable network synthesis |
scientific article |
Statements
On unreliability polynomials and graph connectivity in reliable network synthesis (English)
0 references
1986
0 references
synthesis
0 references
reliable large-scale networks
0 references
graph-theoretic notions
0 references
