TOPICS
Search

Riddell's Formula

Riddell's formula for unlabeled graphs is the Euler transform relating the number of unlabeled connected graphs on n nodes satisfying some property with the corresponding total number (not necessarily connected) of graphs on n nodes.

Riddell's formula for labeled graphs is the exponential transform relating the number of labeled connected graphs on n nodes satisfying some property with the corresponding total number (not necessarily connected) of labeled graphs on n nodes.

See also

Connected Graph, Euler Transform, Exponential Transform, Graph, Labeled Graph, Unlabeled Graph

Explore with Wolfram|Alpha

References

Cadogan, C. C. "The Möbius Function and Connected Graphs." J. Combin. Th. B 11, 193-200, 1971.Harary, F. and Palmer, E. M. Graphical Enumeration. New York: Academic Press, p. 90, 1973.Sloane, N. J. A. and Plouffe, S. The Encyclopedia of Integer Sequences. San Diego, CA: Academic Press, p. 20, 1995.

Referenced on Wolfram|Alpha

Riddell's Formula

Cite this as:

Weisstein, Eric W. "Riddell's Formula." From MathWorld--A Wolfram Web Resource. https://mathworld.wolfram.com/RiddellsFormula.html

Subject classifications