Encyclopedia Britannica
Encyclopedia Britannica
SUBSCRIBE
SUBSCRIBE
SUBSCRIBE TO PREMIUM
  • Home
  • Biographies
  • Animals & Nature
  • History & Society
  • Science & Tech
  • Geography & Travel
  • Arts & Culture
  • ProCon
  • Money
  • Games & Quizzes
  • Videos
  • Today in History
  • Dictionary
  • New Articles
Biographies
  • Browse Biographies
Animals & Nature
  • Birds, Reptiles & Other Vertebrates
  • Environment
  • Fossils & Geologic Time
  • Insects & Other Invertebrates
  • Mammals
  • Plants
History & Society
  • History
  • Philosophy & Religion
  • Politics, Law & Government
  • Society & Social Issues
Science & Tech
  • Health & Medicine
  • Science
  • Technology
Geography & Travel
  • Geography & Travel
Arts & Culture
  • Entertainment & Pop Culture
  • Literature
  • Sports & Recreation
  • Visual Arts
  • Image Galleries
  • Podcasts
  • Summaries
  • Top Questions
  • Lists and Stories
  • Britannica Kids
Ask the Chatbot Games & Quizzes History & Society Science & Tech Biographies Animals & Nature Geography & Travel Arts & Culture ProCon Money Videos
simple graph
References
Images
Five diagrams illustrate types of graphs in mathematics: a simple graph, a multigraph with parallel edges, a complete graph with all possible connections, a graph with a loop, and a directed graph with arrows showing direction.
Britannica AI Icon

simple graph

mathematics
Written by
The Information Architects of Encyclopaedia Britannica

The Information Architects maintain a master list of the topics included in the corpus of  Encyclopædia Britannica, and create and manage the relationships between them.

The Information Architects of Encyclopaedia Britannica

Learn about this topic in these articles:

  • bridges of Königsberg
    graph theory

    …two vertices is called a simple graph. Unless stated otherwise, graph is assumed to refer to a simple graph. When each vertex is connected by an edge to every other vertex, the graph is called a complete graph. When appropriate, a direction may be assigned to each edge to produce…

    Read More

    …two vertices is called a simple graph. Unless stated otherwise, graph is assumed to refer to a simple graph. When each vertex is connected by an edge to every other vertex, the graph is called a complete graph. When appropriate, a direction may be assigned to each edge to produce…

    Read More