Jump to content

Rooted graph

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Schneelocke (talk | contribs) at 04:17, 8 January 2005 (Initial stub). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.
(diff) ← Previous revision | Latest revision (diff) | Newer revision → (diff)

In mathematics, and, in particular, in graph theory, a rooted graph is a mathematical graph in which one node (graph theory) is labelled in a special way to distinguish it from the graph's other node. This special node is called the root of the graph.

The number of rooted graphs for 1, 2, ... nodes is 1, 2, 6, 20, 90, 544, ... (OEIS A000666).

Stub icon

This mathematics-related article is a stub. You can help Wikipedia by expanding it.

Retrieved from "https://en.wikipedia.org/w/index.php?title=Rooted_graph&oldid=12065331"