Geodetic connectivity of graphs
From MaRDI portal
Publication:4111606
DOI10.1109/TCS.1977.1084370zbMath0344.05137MaRDI QIDQ4111606
D. E. Jackson, Roger Entringer, Peter J. Slater
Publication date: 1977
Published in: IEEE Transactions on Circuits and Systems (Search for Journal in Brave)
Related Items (14)
Minimumk-geodetically connected digraphs ⋮ Steiner distance stable graphs ⋮ The recognition of geodetically connected graphs ⋮ Towards minimumk-geodetically connected graphs ⋮ Large fault-tolerant interconnection networks ⋮ Shortest edge-disjoint paths in graphs ⋮ Steiner distance and convexity in graphs ⋮ Minimum 3-geodetically connected graphs ⋮ Minimum cutsets in hypercubes ⋮ Some special minimum \(k\)-geodetically connected graphs ⋮ An efficient distributed algorithm for finding all hinge vertices in networks ⋮ Disjoint shortest paths in graphs ⋮ Counterexamples to theorems of Menger type for the diameter ⋮ Vulnerability in graphs of diameter four
This page was built for publication: Geodetic connectivity of graphs
