articulation point

(redirected from Cut vertex)
Also found in: Wikipedia.

articulation point

[är‚tik·yə′lā·shən ‚pȯint]
(chemical engineering)
References in periodicals archive ?
Since G has no cut vertex, so [absolute value of U] [greater than or equal to] 2.
A vertex, v, is called a cut vertex if G \ v is disconnected.
Case I: Every block of G is incident at the same cut vertex.
II - (a): If B is an end block then B has exactly one cut vertex, say w.
II - (b): If B is not an end block then B may have more than one cut vertex.
In a separable graph G, a block with at most one cut vertex is called an end block.
B] [u] is a wcd set for B for any cut vertex u [member of] B.
B][u] is a proper wcd set for any cut vertex u belonging to B.