The On-Line Encyclopedia of Integer Sequences (OEIS)

The OEIS is supported by the many generous donors to the OEIS Foundation.

Revision History for A374558

(Bold, blue-underlined text is an addition; faded, red-underlined text is a ~~deletion~~.)
Showing all changes.

A374558

Number of maximal matchings in the n-Dorogovtsev-Goltsev-Mendes graph.
(history; published version)

#4 by Michael De Vlieger at Thu Jul 11 22:23:48 EDT 2024

STATUS

proposed

approved

#3 by Eric W. Weisstein at Thu Jul 11 17:09:26 EDT 2024

STATUS

editing

proposed

#2 by Eric W. Weisstein at Thu Jul 11 11:05:39 EDT 2024

NAME

allocated for Eric W. Weisstein

Number of maximal matchings in the n-Dorogovtsev-Goltsev-Mendes graph.

DATA

1, 3, 11, 566, 18843648

OFFSET

0,2

COMMENTS

Using the indexing convention that DGM(0) = P_2.

LINKS

Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/Dorogovtsev-Goltsev-MendesGraph.html">Dorogovtsev-Goltsev-Mendes Graph</a>.

Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/MaximalIndependentEdgeSet.html">Maximal Independent Edge Set</a>.

KEYWORD

allocated

nonn,more

AUTHOR

Eric W. Weisstein, Jul 11 2024

STATUS

approved

editing

#1 by Eric W. Weisstein at Thu Jul 11 11:05:39 EDT 2024

NAME

allocated for Eric W. Weisstein

KEYWORD

allocated

STATUS

approved