Saved Bookmarks
| 1. |
Define Biconnectivity? |
|
Answer» A connected graph G is SAID to be biconnected, if it remains connected after removal of any one vertex and the EDGES that are INCIDENT UPON that vertex. A connected graph is biconnected, if it has no articulation points. A connected graph G is said to be biconnected, if it remains connected after removal of any one vertex and the edges that are incident upon that vertex. A connected graph is biconnected, if it has no articulation points. |
|