Biconnected graph

In graph theory, a biconnected graph is a connected and "nonseparable" graph, meaning that if any vertex were to be removed, the graph will remain connected. Therefore a biconnected graph has no articulation vertices.

The property of being 2-connected is equivalent to biconnectivity, with the caveat that the complete graph of two vertices is sometimes regarded as biconnected but not 2-connected.

单词	Biconnected graph
释义	Biconnected graph 英语百科 Biconnected graph In graph theory, a biconnected graph is a connected and "nonseparable" graph, meaning that if any vertex were to be removed, the graph will remain connected. Therefore a biconnected graph has no articulation vertices. The property of being 2-connected is equivalent to biconnectivity, with the caveat that the complete graph of two vertices is sometimes regarded as biconnected but not 2-connected.
随便看	lazy graph reduction的意思 Lazy guy的意思 lazy halyard的意思 lazy H antenna的意思 lazy的意思 Lazy initialisation的意思 lazy initialisations的意思 Lazy initialization的意思 lazy initializations的意思 lazy intersection的意思 lazy in training的意思 lazyish的意思 lazyitis的意思 Lazy jack的意思 lazyjack的意思 lazyjack的意思 lazy junction pacemaker的意思 Lazy Kate的意思 lazy leucocyte syndrome的意思 lazy leukocyte syndrome的意思 lazy line的意思 lazy list的意思 lazyload的意思 Lazy load的意思 lazyloaded的意思