Content deleted Content added
Tags: Reverted Mobile edit Mobile web edit |
Tags: Reverted Mobile edit Mobile web edit |
||
Line 156:
* [[strongly regular graph]]s and their generalizations [[distance-regular graph]]s.
==
{{see also|Glossary of graph theory|Graph property}}
Two edges of a graph are called ''adjacent'' if they share a common vertex. Two edges of a directed graph are called ''consecutive'' if the head of the first one is the tail of the second one. Similarly, two vertices are called ''adjacent'' if they share a common edge (''consecutive'' if the first one is the tail and the second one is the head of an edge), in which case the common edge is said to ''join'' the two vertices. An edge and a vertex on that edge are called ''incident''.
| |||