in Graph Theory retagged by
387 views
0 votes
0 votes
What is a biconnected componenet?Does it always include V-V’ where V’ represent the set of articulation points of a graph G?
in Graph Theory retagged by
387 views

1 comment

Maximally biconnected sub-graph which does not have an articulation point is a biconnected component.

For the second part, I don't think, consider a complete graph as a counter-example.

ref; https://www.geeksforgeeks.org/biconnected-components/

0
0

Please log in or register to answer this question.

Related questions

Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true