NIST

adjacent

(definition)

Definition: Two vertices of a graph are adjacent if there is an edge between them. Two edges of a graph are adjacent if they connect the same vertex.

Generalization (I am a kind of ...)
binary relation.

Note: The "adjacent" relation is symmetric, but not (necessarily) reflexive or transitive.

Author: PEB


Go to the Dictionary of Algorithms and Data Structures home page.

If you have suggestions, corrections, or comments, please get in touch with Paul Black.

Entry modified 4 November 2004.
HTML page formatted Wed Mar 13 12:42:45 2019.

Cite this as:
Paul E. Black, "adjacent", in Dictionary of Algorithms and Data Structures [online], Paul E. Black, ed. 4 November 2004. (accessed TODAY) Available from: https://www.nist.gov/dads/HTML/adjacent.html