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 ?
This section is based on some important results on even (odd) cycles, bridges in SVNGs and cut vertex of even (odd) cycle.
Let x be a cut vertex of a graph G, and let a and b be vertices in different components of G - x.
The failure of the cut vertex node 14 leaves nodes 13 and 15 was isolated from the rest of the network connection.
If a big block Q contains a unique cut vertex and G - Q is connected, then Q is called a terminal block; if the big block Q contains a unique cut vertex and G - Q is disconnected, then Q is called a suspending block of G.
(ii) [s.sub.v](G) = 1 if and only if v is a cut vertex;
A vertex v in a connected graph G is a cut vertex if G-v is disconnected.
Nonetheless, random deployment, frequent mobility, and network dynamics inherently introduce critical (cut vertex in graph theory) nodes to the network connectivity.
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.
Let a be an arbitrary vertex of G which is not a cut vertex. Without loss of generality, we may suppose that a G A (otherwise, just relabel the parts A and B).
A vertex shared by two or more hexagons is called a cut vertex. If each hexagon of a hexagonal cactus G has at most two cut vertices and each cut vertex is shared by exactly two hexagons, we call G as a chain hexagonal cactus.
Proof: Suppose G - S has a cut vertex y and that G has the structure as depicted in Figure 2.