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)
05C35: Extremal problems in graph theory
Related Items
Towards minimumk-geodetically connected graphs, Shortest edge-disjoint paths in graphs, An efficient distributed algorithm for finding all hinge vertices in networks, The recognition of geodetically connected graphs, Some special minimum \(k\)-geodetically connected graphs, Disjoint shortest paths in graphs, Large fault-tolerant interconnection networks, Vulnerability in graphs of diameter four, Steiner distance stable graphs, Minimum 3-geodetically connected graphs, Minimum cutsets in hypercubes, Counterexamples to theorems of Menger type for the diameter, Steiner distance and convexity in graphs, Minimumk-geodetically connected digraphs