On rigidity and realizability of weighted graphs

14Citations
Citations of this article
10Readers
Mendeley users who have this article in their library.

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 Rr for some 1≤r≤n-2 but not realizable in R(n-1), where n is the number of nodes. © 2001 Elsevier Science Inc.

Cite

CITATION STYLE

APA

Alfakih, A. Y. (2001). On rigidity and realizability of weighted graphs. Linear Algebra and Its Applications, 325(1–3), 57–70. https://doi.org/10.1016/S0024-3795(00)00281-0

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free