Abstract: The visibility graph of a finite set of points in the plane has the points as vertices and an edge between two vertices if the line segment between them contains no other points. This paper establishes bounds on the edge- and vertex-connectivity of visibility graphs. Unless all its vertices are collinear, a visibility graph has diameter at most 2, and so it follows by a result of Plesn'ik (1975) that its edge-connectivity equals its minimum degree. We strengthen the result of Plesn'ik by showing that for any two vertices v and w in a graph of diameter 2, if deg(v) <= deg(w) then there exist deg(v) edge-disjoint vw-paths of length at most 4. Furthermore, we find that in visibility graphs every minimum edge cut is the set of edges incident to a vertex of minimum degree. For vertex-connectivity, we prove that every visibility graph with n vertices and at most l collinear vertices has connectivity at least (n-1)/(l-1), which is tight. We also prove the qualitatively stronger result that the vertex-connectivity is at least half the minimum degree. Finally, in the case that l=4 we improve this bound to two thirds of the minimum degree.
Recommendations
Cites work
- scientific article; zbMATH DE number 4208109 (Why is no real title available?)
- scientific article; zbMATH DE number 3497930 (Why is no real title available?)
- scientific article; zbMATH DE number 2209732 (Why is no real title available?)
- scientific article; zbMATH DE number 7662683 (Why is no real title available?)
- Blocking visibility for points in general position
- Crossing Numbers and Hard Erdős Problems in Discrete Geometry
- Degree sequence conditions for equal edge‐connectivity and minimum degree, depending on the clique number
- Degree sequence conditions for maximally edge-connected graphs depending on the clique number
- Every large point set contains many collinear points or an empty pentagon
- On the chromatic number of the visibility graph of a set of points in the plane
- On the connectivity of visibility graphs
- On visibility and blockers
- Using the Borsuk-Ulam theorem. Lectures on topological methods in combinatorics and geometry. Written in cooperation with Anders Björner and Günter M. Ziegler
- Visibility graphs of point sets in the plane
Cited in
(17)- Recognizing Visibility Graphs of Triangulated Irregular Networks
- Routing on the Visibility Graph
- Visibility number of directed graphs
- scientific article; zbMATH DE number 5976585 (Why is no real title available?)
- On the connectivity of visibility graphs
- Special subgraphs of weighted visibility graphs
- Constrained visibility representations of graphs
- Degree distributions and motif profiles of limited penetrable horizontal visibility graphs
- scientific article; zbMATH DE number 846953 (Why is no real title available?)
- scientific article; zbMATH DE number 841640 (Why is no real title available?)
- COMPLEXITY ASPECTS OF VISIBILITY GRAPHS
- Mutual visibility in graphs
- On the minimum size of visibility graphs
- A note on visibility graphs
- Recognition and complexity of point visibility graphs
- A visibility graph averaging aggregation operator
- A more fine-grained complexity analysis of finding the most vital edges for undirected shortest paths
This page was built for publication: On the connectivity of visibility graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q715001)
