scientific article; zbMATH DE number 3458684

MaRDI QIDQ4044620zbMATH OpenFDO

Authors

Publication date 1969

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Graph theory (05C99) Programming involving graphs or networks (90C35)

Cited in

(12)

• Reliability properties of the hypercube network
• Optimally reliable networks
• Super edge-connectivity of dense digraphs and graphs
• Graphs with most number of three point induced connected subgraphs
• On the design of reliable networks
• On the number of spanning trees of circulant graphs
• Graphs with the smallest number of minimum cut sets
• On unreliability polynomials and graph connectivity in reliable network synthesis
• Analyse und Synthese zuverlässiger Netze
• Super edge- and point-connectivities of the Cartesian product of regular graphs
• On uniformly optimally reliable graphs for pair‐connected reliability with vertex failures
• Graph theoretic characterization and reliability of the multiple-clique network

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4044620)