Property P_d,m and efficient design of reliable networks

DOI10.1002/NET.21456MaRDI QIDQ5326767zbMATH OpenOpenAlexFDO

Authors Ralph Faudree, Ronald Gould, Jeffrey Powell

Publication date 6 August 2013

Published in Networks (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/net.21456

zbMATH Keywords

containerdiameterdisjoint pathsextremal graphsMenger path systemsm}\)property \(P_{d

Mathematics Subject Classification ID

Connectivity (05C40) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Network design and communication in computer systems (68M10) Reliability, testing and fault tolerance of networks and computer systems (68M15) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• scientific article; zbMATH DE number 4059450
• scientific article; zbMATH DE number 975404
• Stronger bounds for generalized degress and Menger path systems
• scientific article; zbMATH DE number 4144025
• The structure of max ?-minm?+1 graphs used in the design of reliable networks

Cites work

• An Extremal Problem of Graphs with Diameter 2
• Edge-wide-diameter of graphs with diameter d
• Generalized diameters and Rabin numbers of networks
• scientific article; zbMATH DE number 4144025 (Why is no real title available?)
• scientific article; zbMATH DE number 4059450 (Why is no real title available?)
• scientific article; zbMATH DE number 3730180 (Why is no real title available?)
• scientific article; zbMATH DE number 2141600 (Why is no real title available?)
• Mengerian properties, hamiltonicity, and claw‐free graphs
• On Critical Graphs of Diameter 2
• On the fault-tolerant diameter and wide diameter of ?-connected graphs
• On the spanningw-wide diameter of the star graph
• Wide diameters of Cartesian product graphs and digraphs

Cited in

(3)

• Analytical characterizations of some classes of optimal strongly attack-tolerant networks and their Laplacian spectra
• On Fault-Tolerant Low-Diameter Clusters in Graphs
• On robust clusters of minimum cardinality in networks

This page was built for publication: Property \(P_{d,m}\) and efficient design of reliable networks

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