scientific article
From MaRDI portal
Publication:4044620
zbMath0293.05143MaRDI QIDQ4044620
No author found.
Publication date: 1969
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Programming involving graphs or networks (90C35) Extremal problems in graph theory (05C35) Graph theory (05C99)
Related Items (12)
Super edge- and point-connectivities of the Cartesian product of regular graphs ⋮ On uniformly optimally reliable graphs for pair‐connected reliability with vertex failures ⋮ Reliability properties of the hypercube network ⋮ On unreliability polynomials and graph connectivity in reliable network synthesis ⋮ On the design of reliable networks ⋮ On the number of spanning trees of circulant graphs ⋮ Graph theoretic characterization and reliability of the multiple-clique network ⋮ Optimally reliable networks ⋮ Super edge-connectivity of dense digraphs and graphs ⋮ Graphs with the smallest number of minimum cut sets ⋮ Graphs with most number of three point induced connected subgraphs ⋮ Analyse und Synthese zuverlässiger Netze
This page was built for publication:
