login

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”).

A364888
Number of minimum vertex cuts in the n-Lucas cube graph.
0
0, 1, 1, 1, 5, 3, 14, 8, 3, 25, 11
OFFSET
1,5
COMMENTS
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.
LINKS
Eric Weisstein's World of Mathematics, Lucas Cube Graph
Eric Weisstein's World of Mathematics, Minimum Vertex Cut
CROSSREFS
Sequence in context: A082983 A083594 A178497 * A367204 A213750 A213774
KEYWORD
nonn,more
AUTHOR
Eric W. Weisstein, Aug 12 2023
STATUS
approved