arXiv Analytics

Sign in

arXiv:1002.1192 [math.CO]AbstractReferencesReviewsResources

An algorithm to prescribe the configuration of a finite graph

Paul Baird, Marius Tiba

Published 2010-02-05Version 1

We provide algorithms involving edge slides, for a connected simple graph to evolve in a finite number of steps to another connected simple graph in a prescribed configuration, and for the regularization of such a graph by the minimization of an appropriate energy functional.

Categories: math.CO
Subjects: 05C85, 05C60
Related articles: Most relevant | Search more
arXiv:1411.5429 [math.CO] (Published 2014-11-20)
Permutation sorting and a game on graphs
arXiv:1103.5517 [math.CO] (Published 2011-03-29)
Weak Convergence of Laws of Finite Graphs
arXiv:2009.01286 [math.CO] (Published 2020-09-02)
Charting the space of chemical nut graphs

Links

Toolbox