A290769 -id:A290769 - cp's OEIS frontend

Showing 1-3 of 3 results.

A289169 Number of connected dominating sets in the n X n white bishop graph.

Original entry on oeis.org

3, 9, 128, 2394, 176192, 13140504, 3695526272

Offset: 2

Eric W. Weisstein, Jun 26 2017

Eric Weisstein's World of Mathematics, Connected Dominating Set
Eric Weisstein's World of Mathematics, White Bishop Graph

Cf. A289145, A289170, A290769.

a(8) from Andrew Howroyd, Sep 04 2017

A290719 Number of (non-null) connected induced subgraphs in the n X n black bishop graph.

Original entry on oeis.org

1, 3, 22, 168, 5251, 194751, 27478594, 3852814320, 2065546517563

Offset: 1

Eric W. Weisstein, Aug 09 2017

Eric Weisstein's World of Mathematics, Black Bishop Graph
Eric Weisstein's World of Mathematics, Connected Graph
Eric Weisstein's World of Mathematics, Vertex-Induced Subgraph

Cf. A289145, A290769.

a(8)-a(9) from Andrew Howroyd, Aug 15 2017

A291595 Number of (non-null) connected induced subgraphs in the n X n bishop graph.

Original entry on oeis.org

1, 6, 35, 336, 8095, 389502, 41541383, 7705628640, 3104759041723

Offset: 1

Eric W. Weisstein, Aug 27 2017

Eric Weisstein's World of Mathematics, Bishop Graph
Eric Weisstein's World of Mathematics, Connected Graph
Eric Weisstein's World of Mathematics, Vertex-Induced Subgraph

Cf. A290719, A290769.

a(n) = A290719(n) + A290769(n) for n > 1. - Andrew Howroyd, Aug 27 2017

a(6)-a(9) from Andrew Howroyd, Aug 27 2017

Showing 1-3 of 3 results.