Large survivable nets and the generalized prisms

DOI10.1016/0166-218X(94)00131-VzbMath0827.05036MaRDI QIDQ1897364

Hong-Jian Lai

Publication date: 27 November 1995

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

connectivitypolynomial algorithmsvulnerabilityedge-connectivitysurvivable networksgeneralized prismsminimum degree of a vertexsurvivable net

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Connectivity (05C40)

Related Items

Distance and connectivity measures in permutation graphs, On the edge-connectivity and restricted edge-connectivity of a product of graphs, Connectivity measures in matched sum graphs, The connectivity of generalized graph products, On restricted connectivities of permutation graphs, (G1,G2)-permutation graphs, On the geodetic number of permutation graphs, On the 3-restricted edge connectivity of permutation graphs, Highly connected star product graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On cycle permutation graphs
• Connectivity of generalized prisms over G
• Minimale \(n\)-fach kantenzusammenhängende Graphen
• The size of strength‐maximal graphs
• k-Degenerate Graphs
• k-Components, Clusters and Slicings in Graphs