Towards minimumk-geodetically connected graphs

DOI10.1002/net.10060zbMath1014.05022OpenAlexW1499566842MaRDI QIDQ4804165

Ján Plesník

Publication date: 10 April 2003

Published in: Networks (Search for Journal in Brave)

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

zbMATH Keywords

geodetic connectivitysurvivable networkdistance invulnerabilityminimum-size graph

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Distance in graphs (05C12) Connectivity (05C40)

Related Items (4)

Minimumk-geodetically connected digraphs ⋮ Minimum 3-geodetically connected graphs ⋮ Some special minimum \(k\)-geodetically connected graphs ⋮ An efficient distributed algorithm for finding all hinge vertices in networks

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The recognition of geodetically connected graphs
• Disjoint shortest paths in graphs
• Minimum self-repairing graphs
• Recognizing hinge-free line graphs and total graphs
• Design of Communication Networks with Survivability Constraints
• Minimumk-geodetically connected digraphs
• Geodetic connectivity of graphs
• On the hardness of approximating spanners

This page was built for publication: Towards minimumk-geodetically connected graphs