This data set collects all 4-regular Ramanujan graphs with at most 16 vertices grouped by their rigidity properties: Rigid Non-rigid Globally rigid Rigid but not globally rigid All files are in Graph6 data format. If a file for a given order does not exist, there are no graphs with that order and the respective property.This work was supported by National Science Foundation (NSF) grants DMS-1600768, CIF-1815922 JSPS Invitational Fellowship for Research in Japan S19016 Austrian Science Fund (FWF) P31888 Simons Foundation 52272
In graph theory, Laman graphs [1] describe the minimally rigid plane structures composed of bars and...
A d-dimensional framework is a graph and a map from its vertices to E^d. Such a framework is globall...
Highly connected molecular graphs are rigid in three dimensions Tibor Jordán⋆ We show that every 7-...
This data set collects all Ramanujan graphs 3-regular with at most 20 vertices 4-regular wi...
This data set collectes all globally rigid graphs for dimension d<=25 with at most d+k vertices, whe...
A rigidity theory is developed for the Euclidean and non-Euclidean placements of countably infinite ...
Abstract. In this note we prove a lower bound for the rank of 2-dimensional generic rigidity matroid...
Determining the rigidity, or global rigidity, of a given framework is NP-hard. This chapter consider...
This data set collectes all redundantly rigid graphs for dimension d<=25 with at most d+k vertices, ...
We show that any graph that is generically globally rigid in ℝd has a realization in ℝd both generic...
Abstract. We examine the generic local and global rigidity of various graphs in Rd. Bruce Hendrickso...
AbstractTensegrity frameworks are defined on a set of points in Rd and consist of bars, cables, and ...
Olyan gráfok 3-dimenziós merevségi tulajdonságairól szól a szakdolgozatom, amelyek poliédergráfokból...
AbstractThe recent combinatorial characterization of generic global rigidity in the plane by Jackson...
Mathematicians have been interested in the rigidity of frameworks since Euler’s conjecture in 1776 t...
In graph theory, Laman graphs [1] describe the minimally rigid plane structures composed of bars and...
A d-dimensional framework is a graph and a map from its vertices to E^d. Such a framework is globall...
Highly connected molecular graphs are rigid in three dimensions Tibor Jordán⋆ We show that every 7-...
This data set collects all Ramanujan graphs 3-regular with at most 20 vertices 4-regular wi...
This data set collectes all globally rigid graphs for dimension d<=25 with at most d+k vertices, whe...
A rigidity theory is developed for the Euclidean and non-Euclidean placements of countably infinite ...
Abstract. In this note we prove a lower bound for the rank of 2-dimensional generic rigidity matroid...
Determining the rigidity, or global rigidity, of a given framework is NP-hard. This chapter consider...
This data set collectes all redundantly rigid graphs for dimension d<=25 with at most d+k vertices, ...
We show that any graph that is generically globally rigid in ℝd has a realization in ℝd both generic...
Abstract. We examine the generic local and global rigidity of various graphs in Rd. Bruce Hendrickso...
AbstractTensegrity frameworks are defined on a set of points in Rd and consist of bars, cables, and ...
Olyan gráfok 3-dimenziós merevségi tulajdonságairól szól a szakdolgozatom, amelyek poliédergráfokból...
AbstractThe recent combinatorial characterization of generic global rigidity in the plane by Jackson...
Mathematicians have been interested in the rigidity of frameworks since Euler’s conjecture in 1776 t...
In graph theory, Laman graphs [1] describe the minimally rigid plane structures composed of bars and...
A d-dimensional framework is a graph and a map from its vertices to E^d. Such a framework is globall...
Highly connected molecular graphs are rigid in three dimensions Tibor Jordán⋆ We show that every 7-...