On biconnected graphs
A graph G is said to be biconnected if G and its complement G prime are connected.This study, presents and proves necessary and sufficient conditions for biconnectedness of graphs, in general, and trees, in particular. It also introduces and investigates properties of a new class of graphs known as...
Saved in:
| 主要作者: | |
|---|---|
| 格式: | text |
| 語言: | English |
| 出版: |
Animo Repository
1995
|
| 主題: | |
| 在線閱讀: | https://animorepository.dlsu.edu.ph/etd_masteral/1662 https://animorepository.dlsu.edu.ph/context/etd_masteral/article/8500/viewcontent/TG02389_F_Redacted.pdf |
| 標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|
| 機構: | De La Salle University |
| 語言: | English |