Metric graphs elastically embeddable in the plane

• Published in: Information processing letters Vol. 55; no. 6; pp. 309 - 315
• Main Authors: Nievergelt, J, Deo, Narsingh
• Format: Journal Article
• Language: English
• Published: Amsterdam Elsevier B.V 29.09.1995; Elsevier Science; Elsevier Sequoia S.A
• Subjects: Combinatorial problems; Combinatorics; Combinatorics. Ordered structures; Computational geometry; Distance geometry; Elasticity; Exact sciences and technology; Frameworks; Geometry; Graph drawing; Graph embedding; Graph theory; Graphs; Information processing; Layout; Mathematics; Rigidity; Sciences and techniques of general use; Studies; Computational geometry; Distance geometry; Layout; Frameworks; Graph drawing; Combinatorial problems; Graph embedding; Rigidity; Plane; Chordal graph; Embedding; Graph theory; Weighted graph
• ISSN: 0020-0190; 1872-6119
• DOI: 10.1016/0020-0190(95)00103-J

We study weighted graphs that can be embedded in the plane in such a way as to preserve an edge's weight as Euclidean distance between its two endpoints. Such questions arise in a variety of layout problems. In automatic graph drawing, for example, vertices are to be placed so as to approximate desired pairwise distances. The analogous 3-d problem arises in the distance geometry approach to molecular modeling, where edge weights are approximate distance measurements. We introduce the concept of elastic embeddability designed to deal with distances subject to error. Elastic graphs are related to, but distinct from, generically rigid graphs known in structural engineering. As an example that can be proven from basic graph-theoretic concepts, we characterize a subclass of elastic graphs: A chordal biconnected graph is elastically embeddable in the plane iff it does not contain the complete graph K4 as a subgraph.