---
tag: JR8XWH71HT
kind: concept
name: Root
sources:
  - wikipedia: en:325802@r1373839425
    locator: Glossary of graph theory, section R
    note: adopted
    mention: wikipedia://en/325802#845R
    sections: [Summary]
inventory: [MD1E75SKBB]
---

## Summary

A designated vertex in a graph, particularly in directed trees and rooted graphs.

The inverse operation to a graph power: a $k$th root of a graph $G$ is another graph on the same vertex set such that two vertices are adjacent in $G$ if and only if they have distance at most $k$ in the root.