login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A291742 Number of maximal independent vertex sets in the n-Fibonacci cube graph. 3
2, 2, 3, 7, 22, 123, 2281, 221074 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,1

COMMENTS

The size of the smallest set, the independent domination number, is given by A291297.

LINKS

Table of n, a(n) for n=1..8.

Eric Weisstein's World of Mathematics, Maximal Independent Vertex Set

Eric Weisstein's World of Mathematics, Fibonacci Cube Graph

Wikipedia, Fibonacci cube

EXAMPLE

Case n=1: The vertices are 0, 1. Each singleton vertex set is a maximal independent set, so a(1) = 2.

Case n=2: The vertices are 00, 01, 10. Maximal independent sets are {00} and {01, 10}, so a(2) = 2.

Case n=3: The vertices are 000, 001, 010, 100, 101. Maximal independent sets are {000, 101}, {010, 101}, {001, 010, 100}, so a(3)=3.

CROSSREFS

Cf. A291297, A291573.

Sequence in context: A032161 A265801 A098738 * A083701 A076996 A139148

Adjacent sequences:  A291739 A291740 A291741 * A291743 A291744 A291745

KEYWORD

nonn,more

AUTHOR

Andrew Howroyd, Aug 30 2017

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified August 20 18:11 EDT 2019. Contains 326154 sequences. (Running on oeis4.)