Abstract. We study spaces of realisations of linkages (weighted graphs) whose underlying graph is a series parallel graph. In particular, we describe an algorithm for determining whether or not such spaces are connected.
This note outlines the realizable extension problem for weighted graphs and provides a detailed analysis of this problem for the weighted graph (K3,3, l). The main result of this analysis is that the moduli space of planar realizations of (K3,3, l) can have one, two, four, six or eight connected components and explicit examples of each case are provided. The note culminates with two examples which show that in general, realizability and connectedness results relating to the moduli spaces of weighted cycles which are contained in a larger weighted graph cannot be extended to similar results regarding the moduli space of the larger weighted graph.Mathematics Subject Classification. 55R80, 51-XX.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.