Content deleted Content added
m Reverted edits by 2A02:C7D:5299:1300:59F7:304F:7D1D:B37A (talk) (HG) (3.3.3) |
|||
Line 38:
===Adjacency relation===
The edges ''E'' of an undirected graph ''G'' induce a symmetric binary relation ~ on ''V'' that is called the ''adjacency relation'' of ''G''. Specifically, for each edge {{nobreak|{''x'', ''y''}}}, the vertices ''x'' and ''y'' are said to be ''adjacent'' to one another, which is denoted {{nobreak|''x'' ~ ''y''}}.
==Types of graphs==
|