Article Per Year (5 Year)
p-Index From 2020 - 2025
0
P-Index
This Author published in this journals
All Journal MATEMATIKA
L., Erly
Unknown Affiliation
Mathematics

Published : 2 Documents Claim Missing Document
Claim Missing Document
Check
Articles

Found 2 Documents
Search

 1 
LANGKAH-LANGKAH PENENTUAN SUATU BARISAN L., Erly
MATEMATIKA Vol 11, No 2 (2008): Jurnal Matematika
Publisher : MATEMATIKA

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (81.9 KB)

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.
SIFAT-SIFAT GRAF (2n) L., Erly; Hariyanto, Susilo
MATEMATIKA Vol 11, No 3 (2008): JURNAL MATEMATIKA
Publisher : MATEMATIKA

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (74.544 KB)

Abstract

A sequence of non negative integers d = (d1, d2, …, dn) is said a sequence of graphic if it is the degree sequence of a simple graph G. In this case, graph G is called realization for d. The set of all realizations of  non isomorfic 2-regular graph with order n (n ≥ 3) is denoted R(2n), whereas a graph with R(2n) as set of  their vertices is denoted (2n) . Two vertices in graph (2n)  are called adjacent if one of these vertices can be derived from the other by switching. In the present paper, we  prove that  for n ≥ 6, (2n) is a connected and bipartite graph.  
Co-Authors susilo hariyanto