---
tag: NTSM9WB1BS
kind: concept
name: Unary vertex
sources:
  - wikipedia: en:325802@r1373839425
    locator: Glossary of graph theory, section U
    note: adopted
    mention: wikipedia://en/325802#WNNH
    sections: [Summary]
inventory: [EWW9FXKJ90]
---

## Summary

In a rooted tree, a unary vertex is a vertex which has exactly one child vertex.