LANGKAH-LANGKAH PENENTUAN SUATU BARISAN SEBAGAI SUATU GRAFIK DENGAN DASAR TEOREMA HAVEL-HAKIMI
| Main Authors: | Listiyana, Erly , Hariyanto, Susilo, Ratnasari, Lucia |
|---|---|
| Format: | Article PeerReviewed application/pdf |
| Terbitan: |
JURUSAN MATEMATIKA FMIPA UNDIP
, 2008
|
| Subjects: | |
| Online Access: |
http://eprints.undip.ac.id/1945/1/2._Erly_L%2C_Susilo_%26_Lucia_R..pdf http://eprints.undip.ac.id/1945/ |
Daftar Isi:
- Consider a non increasing sequence of non negative integres d = (d1, d2, ..., dn) . A sequence d is called a graphic if it is sequnce of degrees on a simple graph with n order. In this paper will be discussed necessary and sufficient conditions of a sequence d be a graphic. And then will be constructed an algorithm to determine a sequence be a graphic, particularly a sequnce with n large order.