LANGKAH-LANGKAH PENENTUAN SUATU BARISAN SEBAGAI SUATU GRAFIK DENGAN DASAR TEOREMA HAVEL-HAKIMI

Listiyana, Erly and Hariyanto, Susilo and Ratnasari, Lucia (2008) LANGKAH-LANGKAH PENENTUAN SUATU BARISAN SEBAGAI SUATU GRAFIK DENGAN DASAR TEOREMA HAVEL-HAKIMI. JURNAL MATEMATIKA KOMPUTER, 11 (2). pp. 60-64. ISSN 1410-8518

[img]
Preview
PDF
130Kb

Abstract

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.

Item Type:Article
Uncontrolled Keywords:sequnce of degrees, graphic.
Subjects:Q Science > QA Mathematics
Divisions:Faculty of Science and Mathematics > Department of Mathematics
ID Code:1945
Deposited By:Mr. Matematika Admin
Deposited On:01 Dec 2009 00:36
Last Modified:04 Dec 2009 09:17

Repository Staff Only: item control page