---
tag: CKJPP0VAZD
kind: concept
name: Graph power
aliases: [power-of-graph, square-of-a-graph]
sources:
  - wikipedia: en:38618878@r1335625130
    locator: Graph power
    note: adopted
    mention: wikipedia://en/38618878
    sections: [Summary]
same_as:
  wikidata: Q5597091
  wikipedia: Graph power
inventory: [CXXDTBCNNB]
---

## Summary

In graph theory, a branch of mathematics, the **$k$th power** $G^{k}$ of an undirected graph $G$ is another graph that has the same set of vertices, but in which two vertices are adjacent when their [[distance|0QV9VNNB4Z]] in $G$ is at most $k$. Powers of graphs are referred to using terminology similar to that of exponentiation of numbers: $G^{2}$ is called the *square* of $G$, $G^{3}$ is called the *cube* of $G$, etc.