Minimum 3-geodetically connected graphs

DOI10.1016/S0166-218X(02)00591-7zbMath1029.05045OpenAlexW2025258636MaRDI QIDQ1406024

Martina Bosíková

Publication date: 9 September 2003

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0166-218x(02)00591-7

zbMATH Keywords

distancegeodeditc connectivity

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Paths and cycles (05C38) Structural characterization of families of graphs (05C75) Distance in graphs (05C12) Connectivity (05C40)

Related Items (2)

Minimumk-geodetically connected digraphs ⋮ Some special minimum \(k\)-geodetically connected graphs

Cites Work

• Unnamed Item
• Parallel concepts in graph theory
• Minimum self-repairing graphs
• Geodetic connectivity of graphs
• Towards minimumk-geodetically connected graphs

This page was built for publication: Minimum 3-geodetically connected graphs