Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #9 Aug 12 2023 18:26:04
%S 0,1,1,1,5,3,14,8,3,25,11
%N Number of minimum vertex cuts in the n-Lucas cube graph.
%C Vertex connectivity of the n-Lucas graph is 0, 1, 1, 1 for n = 1, 2, 3, 4 and ceiling(n/3) for n > 4.
%H Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/LucasCubeGraph.html">Lucas Cube Graph</a>
%H Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/MinimumVertexCut.html">Minimum Vertex Cut</a>
%K nonn,more
%O 1,5
%A _Eric W. Weisstein_, Aug 12 2023