Some special minimum \(k\)-geodetically connected graphs
From MaRDI portal
Publication:548276
DOI10.1016/J.DAM.2011.03.009zbMath1218.05080OpenAlexW2139944636MaRDI QIDQ548276
Publication date: 28 June 2011
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2011.03.009
geodetic connectivitysurvivable networkdistance invulnerabilityminimum size graphrobust system design
Cites Work
- Unnamed Item
- Unnamed Item
- The recognition of geodetically connected graphs
- Parallel concepts in graph theory
- Minimum self-repairing graphs
- Minimum 3-geodetically connected graphs
- Recognizing hinge-free line graphs and total graphs
- Minimumk-geodetically connected digraphs
- Geodetic connectivity of graphs
- Towards minimumk-geodetically connected graphs
This page was built for publication: Some special minimum \(k\)-geodetically connected graphs