WAHYU ARNI SETIAWATI, 089611454 (2002) PEMBENTUKAN SUATU GRAPH 4-TERHUBUNG. Skripsi thesis, UNIVERSITAS AIRLANGGA.
|
Text (ABSTRACT)
KK MPM 23.00 Set p.pdf Download (38kB) | Preview |
Official URL: http:/lib.unair.ac.id
Abstract
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.
| Item Type: | Thesis (Skripsi) | ||||
|---|---|---|---|---|---|
| Subjects: | Q Science > QA Mathematics > QA1 Mathematics (General) | ||||
| Divisions: | 08. Fakultas Sains dan Teknologi > Matematika | ||||
| Creators: |
|
||||
| Depositing User: | Ms noviyanti wulandari | ||||
| Date Deposited: | 22 Feb 2017 22:11 | ||||
| Last Modified: | 22 Feb 2017 22:11 | ||||
| URI: | http://repository.unair.ac.id/id/eprint/53420 | ||||
| Sosial Share: | |||||
Actions (login required)
 |
View Item |