A378862 Number of minimum edge covers in the n-cycle complement graph.

0, 1, 5, 4, 70, 31, 972, 293, 14476, 3326, 237575, 44189, 4305960, 673471, 85836485, 11588884, 1871150248, 222304897

Offset: 3

Author

Eric W. Weisstein, Dec 09 2024

Keywords

• nonn
• more

Comments

For even n, the minimum edge covers are perfect matchings. - Andrew Howroyd, Dec 10 2024

Links

• Eric Weisstein's World of Mathematics, Cycle Complement Graph.
• Eric Weisstein's World of Mathematics, Minimum Edge Cover.

Crossrefs

Cf. A003436, A278990, A351587, A356212.

Formula

a(2*n) = A003436(n). - Andrew Howroyd, Dec 10 2024

a(2*n+1) = (n-1)*(2*n+1)*A278990(n). - Detlef Meya, Dec 12 2024

Extensions

a(10)-a(20) from Andrew Howroyd, Dec 10 2024