---
tag: DPX08FCV5S
kind: concept
name: Universal
sources:
  - wikipedia: en:325802@r1373839425
    locator: Glossary of graph theory, section U
    note: adopted
    mention: wikipedia://en/325802#16NX
    sections: [Summary]
inventory: [5F8N1NS1KG]
---

## Summary

A universal graph is a graph that contains as subgraphs all graphs in a given family of graphs, or all graphs of a given size or order within a given family of graphs.

A universal vertex (also called an apex or dominating vertex) is a vertex that is adjacent to every other vertex in the graph. For instance, wheel graphs and connected threshold graphs always have a universal vertex.

In the logic of graphs, a vertex that is universally quantified in a formula may be called a universal vertex for that formula.