cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

Showing 1-3 of 3 results.

A328060 Number of bipartite Laman graphs on n vertices.

Original entry on oeis.org

1, 1, 0, 0, 0, 1, 1, 5, 19, 123, 871, 8304, 92539, 1210044, 17860267, 293210063, 5277557739, 103177250918, 2174556695546
Offset: 1

Views

Author

Vsevolod Voronov, Oct 03 2019

Keywords

Comments

All the Laman graphs (in other words, minimally rigid graphs) can be constructed by the inductive Henneberg construction, i.e., a sequence of Henneberg steps starting from K_2. A new vertex added by a Henneberg move is connected with two or three of the previously existing vertices. Hence, the chromatic number of a Laman graph can be 2, 3 or 4. One can hypothesize that the set of 3-chromatic Laman graphs is the largest and that bipartite graphs are relatively rare. The first nontrivial bipartite Laman graph is K_{3,3}. An infinite sequence of such graphs can be obtained from K_{3,3} by Henneberg moves of the first type (i.e., adding a vertex and connecting it with two of the existing vertices from the one part).

Crossrefs

Programs

  • Mathematica
    Table[Length[
      Select[LamanGraphs[n],
       BipartiteGraphQ[AdjacencyGraph[G2Mat[#]]] &]], {n, 6, 9}] (* using the program by Christoph Koutschan for generating Laman graphs, see A227117 *)

Extensions

a(13)-a(15) added using tinygraph by Falk Hüffner, Oct 20 2019
a(16)-a(17) added by Martin Larsson, Dec 21 2020
a(18)-a(19) from Martin Larsson added by Max Alekseyev, Jan 14 2025

A371901 Number of unlabeled Laman graphs on n vertices of degree at most 4.

Original entry on oeis.org

1, 1, 1, 1, 3, 10, 37, 189, 1145, 8089, 64683, 571949, 5499343, 56899844, 628729114, 7380050235
Offset: 1

Views

Author

Max Alekseyev, Apr 11 2024

Keywords

Crossrefs

Programs

  • nauty
    gensparseg $n -D4 -K2 -u # With Laman plugin; see link.

Extensions

a(14)-a(16) added by Georg Grasegger, Aug 03 2024

A233288 Number of (3/2,2)-tight graphs with 2n vertices, or kinematic chains with 2n links.

Original entry on oeis.org

1, 1, 2, 16, 230, 6856, 318162, 19819281, 1535380884
Offset: 1

Views

Author

David Eppstein, Dec 06 2013

Keywords

Comments

A 2n-vertex graph is (3/2,2)-sparse if every subgraph with k vertices has at most (3/2)k-2 edges, and (3/2,2)-tight if in addition it has exactly 3n-2 edges; see Lee and Streinu (2008). These graphs represent two-dimensional mechanical systems formed by 2n rigid bodies (links), connected at joints where exactly two links are pinned together and can rotate relative to each other, with the entire system having one degree of freedom and having no rigid subsystems. The vertices of the graph represent links and the edges represent joints.

Examples

			For n=1 the single example (a graph with two vertices and one edge) is represented by familiar mechanical systems including door hinges and pairs of scissors. For n=3 the a(3)=2 solutions are the 6-vertex 7-edge graphs Theta(1,3,3) and Theta(2,2,3), each of which has two degree-three vertices connected by three paths of the given lengths. These correspond respectively to the Watt linkage (two four-bar linkages sharing a pair of adjacent links) and the Stephenson linkage.
		

Crossrefs

Programs

  • nauty
    gensparseg 2*$n -K3/2L2 -u # With Laman plugin; see Larsson link.

Extensions

a(9) from Martin Larsson added by Max Alekseyev, Jan 14 2025
Showing 1-3 of 3 results.