Some special minimum k-geodetically connected graphs

DOI10.1016/J.DAM.2011.03.009zbMATH Open1218.05080OpenAlexW2139944636MaRDI QIDQ548276FDOQ548276

Songqing Chen, Yingjie Lan

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

zbMATH Keywords

geodetic connectivitysurvivable networkdistance invulnerabilityminimum size graphrobust system design

Mathematics Subject Classification ID

Distance in graphs (05C12) Connectivity (05C40)

Cites Work

• Title not available (Why is that?)
• Parallel concepts in graph theory
• The recognition of geodetically connected graphs
• Geodetic connectivity of graphs
• Minimum self-repairing graphs
• Minimum 3-geodetically connected graphs
• Recognizing hinge-free line graphs and total graphs
• Minimumk-geodetically connected digraphs
• Title not available (Why is that?)
• Towards minimumk-geodetically connected graphs

Cited In (3)

• Minimum 3-geodetically connected graphs
• Minimumk-geodetically connected digraphs
• Towards minimumk-geodetically connected graphs

   Recommendations

• Towards minimumk-geodetically connected graphs 👍 👎
• Minimumk-geodetically connected digraphs 👍 👎
• Minimum 3-geodetically connected graphs 👍 👎
• The recognition of geodetically connected graphs 👍 👎
• The \(k\)-edge geodetic number of a graph 👍 👎

This page was built for publication: Some special minimum \(k\)-geodetically connected graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q548276)