PEMBENTUKAN SUATU GRAPH 4-TERHUBUNG
| Main Author: | WAHYU ARNI SETIAWATI, 089611454 |
|---|---|
| Format: | Thesis NonPeerReviewed Book |
| Bahasa: | ind |
| Terbitan: |
, 2002
|
| Subjects: | |
| Online Access: |
http://repository.unair.ac.id/53420/1/KK%20MPM%2023.00%20Set%20p.pdf http://repository.unair.ac.id/53420/ http:/lib.unair.ac.id |
Daftar Isi:
- LET G1 IS THE LONGEST CYCLE AT 2-CONNECTED GRAPH. IF G1 HAS LENGTH 4, THAN 4-CONNECTED GRAPH CAN MADE FROM 2-CONNECTED GRAPH WITH INCRASE n-1 EDGES. IF G1 HAS LENGTH AT LEAST 5, THAN 4-CONNECTED GRAPH CAN MADE FROM 2-CONNECTED GRAPH WITH INCRASE N EDGES.