Title of article
On rigidity and realizability of weighted graphs Original Research Article
Author/Authors
Abdo Y. Alfakih، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2001
Pages
14
From page
57
To page
70
Abstract
Recently, a new characterization of rigid graphs was introduced using Euclidean distance matrices (EDMs) [A.Y. Alfakih, Linear Algebra Appl. 310 (2000) 149]. In this paper, we address the computational aspects of this characterization. Also we present a characterization of graphs which are realizable in image for some 1less-than-or-equals, slantrless-than-or-equals, slantn−2 but not realizable in image, where n is the number of nodes.
Keywords
Convex sets , Realizations of graphs , Euclidean distance matrices , semidefinite programming , Weighted graphs , Slater condition , Rigidity
Journal title
Linear Algebra and its Applications
Serial Year
2001
Journal title
Linear Algebra and its Applications
Record number
823197
Link To Document