Graph (discrete mathematics): Difference between revisions

Revision as of 20:49, 10 January 2018

Revision as of 21:10, 10 January 2018

Line 57:

====Undirected graph====

An ''undirected graph'' is a graph in which edges have no orientation. The edge {{nobreak|(''x'', ''y'')}} is identical to the edge {{nobreak|(''y'', ''x'')}}. That is, they are not ordered pairs, but unordered pairs—i.e., sets of two vertices {{nobreak|{''x'', ''y''}}} (or 2-[[Multiset|multisets]] toin accomodatethe acase of [[Loop (graph theory)|loop]]s). The maximum number of edges in an undirected graph without a loop is {{nobreak|''n''(''n'' − 1)/2}}.

====Directed graph====