An undirected graph has edges that are unordered pairs of vertices. In a simple undirected graph there are no loops or multiple edges. The skeleton of a directed graph forgets the directions of its edges and is an undirected graph.

Ancestors (5)

  1. Graph theory
  2. Foundations of mathematics
  3. Area of mathematics
  4. Mathematics
  5. Home

Incoming links (2)

View article source

Discussion (0)

New discussion

There are no discussions about this article yet.

Articles by others on the same topic (1)

Undirected graph by Ciro Santilli 40 Updated 2025-07-16
Read the full article
See all articles in the same topic Create my own version