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-2 of 2 results.

A288943 Number of independent vertex sets (and vertex covers) in the n-halved cube graph.

Original entry on oeis.org

2, 3, 5, 13, 57, 889, 104929, 469095585
Offset: 1

Views

Author

Eric W. Weisstein, Jun 19 2017

Keywords

Crossrefs

Row sums of A355226.

A355558 The independence polynomial of the n-halved cube graph evaluated at -1.

Original entry on oeis.org

0, -1, -3, -3, 25, -135, -2079, 1879969
Offset: 1

Views

Author

Christopher Flippen, Jul 06 2022

Keywords

Comments

The independence number alpha(G) of a graph is the cardinality of the largest independent vertex set. The n-halved graph has alpha(G) = A005864(n). The independence polynomial for the n-halved cube is given by Sum_{k=0..alpha(G)} A355226(n,k)*t^k, meaning that a(n) is the alternating sum of row n of A355226.

Examples

			Row 5 of A355226 is 1, 16, 40. This means the 5-halved cube graph has independence polynomial 1 + 16*t + 40*t^2. Taking the alternating row sum of row 5, or evaluating the polynomial at -1, gives us 1 - 16 + 40 = 25 = a(5).
		

Crossrefs

Programs

  • Sage
    from sage.graphs.independent_sets import IndependentSets
    def a(n):
        if n == 1:
            g = graphs.CompleteGraph(1)
        else:
            g = graphs.HalfCube(n)
        icount=0
        for Iset in IndependentSets(g):
            if len(Iset) % 2 == 0:
                icount += 1
            else:
                icount += -1
        return icount
Showing 1-2 of 2 results.