Geodetic connectivity of graphs

DOI10.1109/TCS.1977.1084370MaRDI QIDQ4111606zbMATH OpenFDO

Authors R. C. Entringer, D. E. Jackson, Peter Slater

Publication date 1977

Published in IEEE Transactions on Circuits and Systems (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/TCS.1977.1084370

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35)

Cited in

(15)

• Towards minimumk-geodetically connected graphs
• Some special minimum \(k\)-geodetically connected graphs
• Counterexamples to theorems of Menger type for the diameter
• The recognition of geodetically connected graphs
• Minimum 3-geodetically connected graphs
• Minimum cutsets in hypercubes
• Disjoint shortest paths in graphs
• Steiner distance and convexity in graphs
• Vulnerability in graphs of diameter four
• Steiner distance stable graphs
• Minimumk-geodetically connected digraphs
• Large fault-tolerant interconnection networks
• Shortest edge-disjoint paths in graphs
• An efficient distributed algorithm for finding all hinge vertices in networks
• Designing distrance-preserving fault-tolerant topologies

This page was built for publication: Geodetic connectivity of graphs

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