Pseudoline arrangement graphs: degree sequences and eccentricities

arXiv2103.02283MaRDI QIDQ6362014FDOQ6362014

Authors: Sandip Das, S. B. Rao, Uma kant Sahoo 

Publication date: 3 March 2021

Abstract: A pseudoline arrangement graph is a planar graph induced by an embedding of a (simple) pseudoline arrangement. We study the corresponding graph realization problem and properties of pseudoline arrangement graphs. In the first part, we give a simple criterion based on the degree sequence that says whether a degree sequence will have a pseudoline arrangement graph as one of its realizations. In the second part, we study the eccentricities of vertices in such graphs. We observe that the diameter (maximum eccentricity of a vertex in the graph) of any pseudoline arrangement graph on $n$ pseudolines is $n-2$. Then we characterize the diametrical vertices (whose eccentricity is equal to the graph diameter) of pseudoline arrangement graphs. These results hold for line arrangement graphs as well.

Mathematics Subject Classification ID

Vertex degrees (05C07) Planar arrangements of lines and pseudolines (aspects of discrete geometry) (52C30)

This page was built for publication: Pseudoline arrangement graphs: degree sequences and eccentricities

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