Connectedness of digraphs and graphs under constraints on the conditional diameter

DOI10.1002/net.20051zbMath1066.68098OpenAlexW4241450939MaRDI QIDQ4667716

Camino Balbuena, J. Fàbrega, Xavier Marcote

Publication date: 21 April 2005

Published in: Networks (Search for Journal in Brave)

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

zbMATH Keywords

fault-tolerancesuperconnectivity

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Reliability, testing and fault tolerance of networks and computer systems (68M15) Connectivity (05C40)

Related Items (2)

Network reliability: Heading out on the highway ⋮ Conditional diameter saturated graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Diameter, short paths and superconnectivity in digraphs
• Sufficient conditions for maximally connected dense graphs
• Super edge-connectivity of dense digraphs and graphs
• Synthesis of reliable networks - a survey
• Maximally connected digraphs
• Superconnected digraphs and graphs with small conditional diameters

This page was built for publication: Connectedness of digraphs and graphs under constraints on the conditional diameter