node
Sign in to saveAlso known as graph vertex, graph node, node of a graph, vertex of a graph, vertices, vertex
unit connected by edges with other units in a graph, in graph theory
Described at
Wolfram|Alpha Examples: Graph Theory
Graph theory computations and visualizations. Create, compare and analyze named graphs, adjacency rules, random graphs and regular k-ary trees.
wolframalpha.com →Link to a page describing this subject · 3,155 chars · not written by Vinony
Wikidata facts
Show 3 more facts
- name
- vertex
- Commons category
- Vertex (graph theory)
Sources (2)
via Wikidata · CC0
~5 min read
Article
A graph with 6 vertices and 7 edges where the vertex number 6 on the far-left is a leaf vertex or a pendant vertex In discrete mathematics, and more specifically in graph theory, a vertex (plural vertices) or node is the fundamental unit of which graphs are formed: an undirected graph consists of a set of vertices and a set of edges (unordered pairs of vertices), while a directed graph consists of a set of vertices and a set of arcs (ordered pairs of vertices). In a diagram of a graph, a vertex is usually represented by a circle with a label, and an edge is represented by a line or arrow extending from one vertex to another.
From the point of view of graph theory, vertices are treated as featureless and indivisible objects, although they may have additional structure depending on the application from which the graph arises; for instance, a semantic network is a graph in which the vertices represent concepts or classes of objects.