Property Pd,m and efficient design of reliable networks

DOI10.1002/net.21456zbMath1269.68036OpenAlexW2068341997MaRDI QIDQ5326767

Ronald J. Gould, Ralph J. Faudree, Jeffrey Scott 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

containerextremal graphsdiameterdisjoint pathsMenger path systemsm}\)property \(P_{d

Mathematics Subject Classification ID

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

Related Items (3)

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Generalized diameters and Rabin numbers of networks
• Wide diameters of Cartesian product graphs and digraphs
• Edge-wide-diameter of graphs with diameter \(d\)
• On the spanningw-wide diameter of the star graph
• An Extremal Problem of Graphs with Diameter 2
• Mengerian properties, hamiltonicity, and claw‐free graphs
• On the fault-tolerant diameter and wide diameter of ?-connected graphs
• On Critical Graphs of Diameter 2

This page was built for publication: Property P_d,m and efficient design of reliable networks