Article Per Year (5 Year)
p-Index From 2019 - 2024
0.659
P-Index
This Author published in this journals
All Journal Media Statistika MATEMATIKA Jurnal Matematika Semantik Journal of Fundamental Mathematics and Applications Pattimura Proceeding : Conference of Science and Technology
Robertus Heri Sulistyo Utomo
Departemen Matematika, Fakultas Sains Dan Matematika, Universitas Diponegoro
Agriculture, Biological Sciences & Forestry Astronomy Biochemistry, Genetics & Molecular Biology Chemical Engineering, Chemistry & Bioengineering Chemistry Civil Engineering, Building, Construction & Architecture Computer Science & IT Control & Systems Engineering Decision Sciences, Operations Research & Management Energy Engineering Materials Science & Nanotechnology Mathematics Physics Other

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

Found 27 Documents
Search

 1   2   3 
ANALISIS PENGARUH KARAKTERISTIK WILAYAH (KELURAHAN) TERHADAP BANYAKNYA KASUS DEMAM BERDARAH DENGUE (DBD) DI KOTA SEMARANG Rahmawati, Rita; Kartono, Kartono; Sulistyo, Robertus Heri; Noranita, Betha; Sarwoko, Eko Adi; Wardaya, Asep Yoyo
MEDIA STATISTIKA Vol 5, No 2 (2012): Media Statistika
Publisher : Department of Statistics, Faculty of Science and Mathematics, Universitas Diponegoro

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (251.452 KB) | DOI: 10.14710/medstat.5.2.87-93

Abstract

DBD still become one of the major problems of public health in Indonesia because the death rate tended sufferers to increase from year to year. Incredible happening (KLB) of DBD which was initially occurring every five years, now it’s getting often happens. In the city of Semarang, during 2009 occurring 165 times KLB in urban village, 35 times KLB in the level of community health centers and 15 times KLB at the district level. Though the number of DBD cases in 2009 from 2008 was declining, but in this year also noted that the number of deaths resulting from DBD increased to 43 people from 18 people in 2008. This research aims to analyze the characteristics of the neighborhood (whose data is always updated by BPS via PODES) that affect the number of cases of DBD (whose data is always updated by DKK) in Semarang city, by creating the best regression models using stepwise technique. Regression model analysis of results obtained best is Y = 23.029 + 0.004 X1 – 0.074 X2 + 0.070X3, where Y is IR/10000 PDDK, that is the number of residents affected by DBD for each 10000 inhabitants, X1 is the number of residents aged 15-24 years, X2 is total area of land of rice fields and X3 is area of land for buildings and grounds around the page. Keywords: DBD, Characteristics of the Neighborhood, Regression, Stepwise
RESULTAN DARI POLINOMIAL DENGAN n - INDETERMINATE Harjito, Harjito; Soelistyo, Robertus Heri; DR, Karuniawati
MATEMATIKA Vol 10, No 3 (2007): JURNAL MATEMATIKA
Publisher : MATEMATIKA

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

Abstract

Let  be polynomials where K is a field. To determine whether two polynomials have a common factor without doing any divisions in K[x] can be seen from its resultant, that is determinant from Sylvester matrix. Two polynomials will have a common factor if and only if its resultant is zero. If its resultant isn’t zero so two polynomials have not a common factor. Wants to be look for resultant  where  in  where C is the set of all complex numbers. To make the easy resultant computations is used by maple 8.                
PELABELAN PRIME CORDIAL PADA BEBERAPA GRAF YANG TERKAIT DENGAN GRAF SIKEL Hapsari, Nindita Yuda; Utomo, Robertus Heri Soelistyo; Ratnasari, Lucia
MATEMATIKA Vol 18, No 1 (2015): Jurnal Matematika
Publisher : MATEMATIKA

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

Abstract

Prime cordial labeling of a graph  is a bijective mapping of the set vertex  to the set  where  is the number of vertex . The edge labeling induced the vertex labeling, which is obtained by finding the great common divisor (gcd) of the label of vertex which it’s adjacent. If gcd of the adjacent vertex label is 1 then the label of edge is 1, but if gcd of the adjacent vertex label value other than 1 then the label of edge is 0, and the absolute value of the difference between the number of edges labeled 0 and the number of edges labeled 1 is less than equal with 1. A graph admits prime cordial labeling is called prime cordial graph. In this paper, we study about edge duplication cycle graph  (except for ), vertex duplication cycle graph , path union union of cycle the graph  and friendship graph one point union of    copies of cycle .
PELABELAN GRACEFUL GENAP BARU PADA GRAF CmPn Ratnasari, Lucia; Surarso, Bayu; Utomo, Robertus Heri Soelistyo
MATEMATIKA Vol 17, No 2 (2014): Jurnal Matematika
Publisher : MATEMATIKA

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

Abstract

Pelabelan Graceful pada graf dengan q sisi merupakan pemetaan injektif   , yang mengakibatkan pemetaan , yang didefinisikan dengan  bersifat bijektif. Graf yang memenuhi pelabelan graceful disebut graf graceful. T. Mahalaksmi Senthil Kumar, T. Abarna Parthiban dan T. Vanadhi [4], membuktikan graf CmÈPn merupakan graf graceful genap untuk m ganjil yang memenuhi kondisi tertentu. Marry U dan Saranya D [2], membuktikan bahwa graf CmÈPn merupakan graf graceful genap untuk m genap yang memenuhi kondisi tertentu. Pelabelan graceful genap didefinisikan sebagai pemetaan injektif  yang mengakibatkan pemetaan , yang didefinisikan  bersifat bijektif.  Tetapi pada pembuktian [4] dan [2], syarat injektif dan bijektif fungsinya tidak terpenuhi. Artikel ini mendefinisikan kembali pelabelan graceful genap pada graf CmÈPn sehingga syarat injektif dan bijektif fungsinya terpenuhi.  
PELABELAN GRACEFUL SISI BERARAH PADA GRAF GABUNGAN GRAF SIKEL DAN GRAF STAR Octafiani, Putri; Utomo, Robertus Heri Soelistyo
MATEMATIKA Vol 16, No 1 (2013): Jurnal Matematika
Publisher : MATEMATIKA

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

Abstract

Let G is simple and finite graph. Graph G is called a directed edge-gracefull graph  if there exists an orientation of G and bijective map  f : A(G) → {1,2, ..., q} such as a map g on V defined by g(v) = [f +(v) – f –(v)] (mod p) is bijective map, which is  f +(v) is the sum of the labels of arcs with v as a head and  f –(v) is the sum of the labels of all arc with v as a tail.  Graph with directed edge-gracefull labeling is called directed edge-gracefull graph. In this paper we will discussed about directed edge-gracefull labeling of cycle and star related graph
ANALISA KESTABILAN MODEL MATEMATIKA UNTUK PENYEMBUHAN KANKER MENGGUNAKAN ONCOLYTIC VIROTHERAPY Novellina, Via; Utomo, Robertus Heri Soelistyo; ., Widowati
MATEMATIKA Vol 19, No 2 (2016): Jurnal Matematika
Publisher : MATEMATIKA

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

Abstract

Oncolytic virotherapy is one type of cancer treatment using oncolytic virus. In this paper, we will present a mathematical model for treatment of cancer using  oncolytic virotherapy with the burst size of a virus (the number of new viruses released from lysis of an infected cell) and we considering the presence of syncytia which is a fusion between infected tumor cell and uninfected tumor cell. In this mathematical model we introduced the population of uninfected tumor cells which fusion in syncytia. So, in this model contains four population, which are, uninfected tumor cell population, infected tumor cell population, uninfected tumor cell population which fusion in syncytia, and free virus particles which are outside cells. Then, these models are analyzed to determine the stability of the equilibrium points. The stability of the equilibrium points criteria is based on basic reproduction number () and we show that there exist a disease free equilibrium point and a disease endemic equilibrium point. By the Routh-Hurwitz criterion of stability, we prove that the disease free equilibrium point is locally asymptotically stable if  and the disease endemic equilibrium point is locally asymptotically stable if . In this numerical simulations using software Maple we have, if  then the graphic of this mathematical model will reach the disease free equilibrium point, then virotherapy fails. While, if  then the graphic of this mathematical model will reach the disease endemic equilibrium point, then virotherapy success.
ANALISA KINERJA SISTEM KONTROL DISKRIT CHAOS LUP TERBUKA DAN TERTUTUP DENGAN PENGENDALI IMPULSIF Utomo, Robertus Heri Soelistyo; Widowati, Widowati; Munawwaroh, Dita Anies; Asnawi, Yuliyan Hambyah
MATEMATIKA Vol 20, No 1 (2017): JURNAL MATEMATIKA
Publisher : MATEMATIKA

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

Abstract

tability the discrete chaotic systems is interesting to be discussed, given that chaos is closely related to random and irregular state. Stability of discrete chaotic system can be obtained using impulsive control law and applying Lyapunov stability theory. So it can show sufficient conditions for the design of impulsive controllers and  globally exponentially set-stable can be reached. Based on the results of the impulsive  control, it is seen that the behavior of chaos in a discrete chaos system which originally the trajectory are irregular, can be control and become stable, and there is a globally exponentially attracting set earned in the system. The numerical simulation on the discrete chaotic system is presented to illustrate the effectiveness of the obtained results from control impulsive.
PELABELAN TOTAL TITIK AJAIB PADA COMPLETE GRAPH DENGAN n GANJIL Irawati, Novi; Soelistyo, Robertus Heri
MATEMATIKA Vol 13, No 3 (2010): JURNAL MATEMATIKA
Publisher : MATEMATIKA

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

Abstract

Let G be a graph consists of edges and vertex. A vertex-magic total labeling of a graph  is a bijection map of union edges and vertex to the integers such that there exists a positive integer  satisfying , for every elements of vertex. Then k  is called a magic constant and G is called vertex-magic total graph. In this article, we consider a vertex-magic labeling of complete graph  for odd with use an algorithm which is composed of a modified construction magic square algorithm.
KONSTRUKSI, SIFAT DAN DIMENSI HIMPUNAN CANTOR MIDDLE THIRD Alfiana, Khoiroh; Khabibah, Siti; Utomo, Robertus Heri Soelistyo
MATEMATIKA Vol 16, No 1 (2013): Jurnal Matematika
Publisher : MATEMATIKA

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

Abstract

This paper discussed about the construction of Cantor middle third set which is formed from unit interval . To construct the Cantor set, take a line and remove the middle third and remain two line segments. This Process is repeated infinite number of times. This process produces some interesting properties on Cantor middle third set, such as has uncountable many elements, contains no intervals, and is compact, perfect, and nowhere dense. By using Hausdorff dimension and self similar set, it discussed the dimension of Cantor middle third set which is a unique positive number
BILANGAN DOMINASI DAN BILANGAN KEBEBASAN GRAF BIPARTIT KUBIK Santoso, Budi; Djuwandi, Djuwandi; S.U, Robertus Heri
MATEMATIKA Vol 15, No 1 (2012): JURNAL MATEMATIKA
Publisher : MATEMATIKA

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

Abstract

Let a graph , is a pair of sets V vertices and set E edges. Let  be a subset of . If each vertex of  is adjacent to atleast one vertex of , then  is called a dominating set in . The domination number of a graph  denoted as  is the minimum cardinality of a dominating set in . A set of vertices in a graph is said to be an independent set if no two vertices in the set are adjacent. the number of vertices in the largest independent set of a graph  is called the independence number and denoted by . In this final project, we consider the relation between independent set and dominating set of finite simple graphs. In particular, discuss them for some cubic bipartite graphs and find that the domination number is less than  of the number of vertices and independence number  is half of the number of vertices.  
Co-Authors Abdul Aziz Ana Mawati Anindita Henindya Permatasari Aprilia, Maita Asep Yoyo Wardaya Asnawi, Yuliyan Hambyah Astuti, Nita Dwi Bambang Irawanto Bayu Surarso Betha Noranita Djuwandi Djuwandi Dwi Budi Santoso Eko Adi Sarwoko Farikhin Farikhin Harjito - Istiani, Laila Kartono . Karuniawati DR Khoiroh Alfiana, Khoiroh L Niswah, L Lucia Ratnasari Lucia Ratnasari M.Pd S.T. S.Pd. I Gde Wawan Sudatha . Munawwaroh, Dita Anies Nindita Yuda Hapsari, Nindita Yuda Novi Irawati Novi Irawati Primas Tri Anjar Anjani Putri Octafiani, Putri Redemtus Heru Tjahjana Rita Rahmawati Siti Khabibah Siti Khabibah Solikhin Solikhin Ulniyatul Ula Via Novellina, Via Widowati ., Widowati Y.D. Sumanto YD Sumanto Yundari, Yundari