Concept

Graph (Discrete Mathematics)

Combinatorics and Graph Theory

In discrete mathematics, particularly graph theory, a graph is a structure consisting of a set of objects, called vertices, in which some pairs are related by connections called edges; a graph is typically depicted as dots or circles for vertices joined by lines or curves for edges. Edges may be directed or undirected: an edge between two people who shook hands is undirected, since the relation is necessarily mutual, while an edge from a person who owes another money is directed, since owing is not necessarily reciprocated. The word graph was first used in this mathematical sense by J. J. Sylvester in 1878, drawing a direct relation between mathematics and chemical structure.

Facts
Origin Year
1878 1
Connections

Associated With

Hypergraph, Concepts

Attributed To

Source Graph (Discrete Mathematics) (Wikipedia)

In Branch

Source Graph (Discrete Mathematics) (Wikipedia)

Kind Of Object Of

Source Dynkin diagram (Wikipedia)
Sources
1. Graph (Discrete Mathematics) (Wikipedia)
Wikimedia Foundation
  • Lead section
    a graph is a structure consisting of a set of objects where some pairs of the objects are in some sense "related"
  • Lead section, origin year
    The word "graph" was first used in this sense by J. J. Sylvester in 1878
  • Attributed To: James Joseph Sylvester, Article text
    Sylvester in 1878 due to a direct relation between mathematics and chemical structure (what he called a chemico-graphical image).
View the Source
Dynkin diagram (Wikipedia)
Kind Of Object Of: Dynkin diagram, Lead
Quote, Kind Of Object Of: Dynkin diagram, Lead
a Dynkin diagram, named for Eugene Dynkin, is a type of graph
View the Source

Take a Related Quiz

Comments (0)
No comments yet. Be the first to share a thought.
Reader Challenges (0)
No disputes yet. Spotted an error or a better source? Open the first one.

Mathematics Atlas

How Proof Is Made
Sign In
Text size
100%
Theme