PEMBENTUKAN SUATU GRAPH 4-TERHUBUNG
LET G₁ IS THE LONGEST CYCLE AT 2-CONNECTED GRAPH. IF G₁ HAS LENGTH 4, THAN 4-CONNECTED GRAPH CAN MADE FROM 2-CONNECTED GRAPH WITH INCRASE n-1 EDGES. IF G₁ HAS LENGTH AT LEAST 5, THAN 4-CONNECTED GRAPH CAN MADE FROM 2-CONNECTED GRAPH WITH INCRASE N EDGES.
Saved in:
| Main Author: | |
|---|---|
| Format: | Theses and Dissertations NonPeerReviewed |
| Language: | Indonesian |
| Published: |
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 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Institution: | Universitas Airlangga |
| Language: | Indonesian |
Be the first to leave a comment!