login
A359995
Number of maximal independent sets in the 2-Fibonacci digraph of order n.
3
2, 3, 4, 10, 32, 184, 5110, 681454
OFFSET
1,1
COMMENTS
See Dalfó and Fiol (2019) or A360000 for the definition of the 2-Fibonacci graph.
The loop at node 0 is disregarded, so 0 is allowed in the independent sets.
LINKS
C. Dalfó and M. A. Fiol, On d-Fibonacci digraphs, arXiv:1909.06766 [math.CO], 2019.
PROG
(Python)
import networkx as nx
def F(n): return nx.DiGraph(((0, 0), (0, 1), (1, 0))) if n == 1 else nx.line_graph(F(n-1))
def A359995(n): return sum(1 for c in nx.find_cliques(nx.complement(nx.Graph(F(n)))))
CROSSREFS
KEYWORD
nonn,more
AUTHOR
STATUS
approved