Adjacent vertices: различия между версиями

'''Adjacent vertices''' --- смежные вершины.  

'''1.''' Two different vertices that incident with the

same edge are called '''adjacent vertices'''.

'''2.''' In a digraph <math>G = (V,A)</math>, a vertex <math>u</math> is '''adjacent to''' <math>v</math> if

<math>(u,v) \in A(G)</math>, and <math>u</math> is '''adjacent from''' <math>w</math>

'''3.''' On adjacent vertices in a hypergraph, see '' Partial edge''.