Talk:Graph Theory/Definitions

Definitions
The definition of a graph is currently phrased as an ordered pair:

"A graph is an ordered pair $$G = (V, E)$$ where, [...]"

It would be better, I think, to define a graph as a set:

"A graph is a set $$G = \{V, E\} $$ of two sets, $$V$$ and $$E$$, where, [...]"

First, no ambiguity is introduced, since each the vertex set and the edge set contain distinct elements, and the vertex set may not be empty. Second, this is slightly more pure with respect to mathematics: Graphs are all about sets, so there's no inherent reason to muddle that. Finally, if we never use the ordering of the ordered pair, then there's no reason to introduce it in the first place.

What do you think? Josh5923 (discuss • contribs) 18:27, 5 July 2020 (UTC)