Garuda - Garba Rujukan Digital

Article Per Year (5 Year)

p-Index From 2019 - 2024

0.888

P-Index

This Author published in this journals

All Journal JURNAL ILMIAH MATEMATIKA DAN TERAPAN

I W Sudarsana

Unknown Affiliation

Author-ID : 3752868

Mathematics

Published : 14 Documents Claim Missing Document

Claim Missing Document

Articles

1 2

KELAS GRAF RAMSEY MINIMAL R(〖3K〗_2,F_5 ) YANG TERBATAS PADA ORDE DAN DIAMETER K Saleh; I W Sudarsana; Resnawati Resnawati
JURNAL ILMIAH MATEMATIKA DAN TERAPAN Vol. 13 No. 2 (2016)
Publisher : Program Studi Matematika, Universitas Tadulako

KELAS GRAF RAMSEY MINIMAL YANG TERBATAS PADA ORDE DAN DIAMETER

PELABELAN TOTAL BUSUR-AJAIB b-BUSUR BERURUTAN PADA GRAF LOBSTER L_n (2;r;t) DAN L_n (2;r,s;t) Nurjana Nurjana; I W Sudarsana; Resnawati Resnawati
JURNAL ILMIAH MATEMATIKA DAN TERAPAN Vol. 14 No. 1 (2017)
Publisher : Program Studi Matematika, Universitas Tadulako

PELABELAN TOTAL BUSUR-AJAIB b-BUSUR BERURUTANPADA GRAF LOBSTER L_n (2;r;t) DAN L_n (2;r,s;t)

PELABELAN PRIME CORDIAL UNTUK GRAF BUKU DAN GRAF MATAHARI YANG DIPERUMUM S Pranata; I W Sudarsana; S Musdalifah
JURNAL ILMIAH MATEMATIKA DAN TERAPAN Vol. 14 No. 1 (2017)
Publisher : Program Studi Matematika, Universitas Tadulako

PELABELAN PRIME CORDIAL UNTUK GRAF BUKU DAN GRAF MATAHARIYANG DIPERUMUM

IMPLEMENTASI ALGORITMA DYNAMIC PROGRAMMING PADA APLIKASI PERHITUNGAN BIAYA PRODUKSI PRODUK PERCETAKAN DENGAN MENGGUNAKAN VISUAL BASIC (STUDI KASUS : CV. BRIZKY ADVERTISING) A T Manurung; I W Sudarsana; A Sahari
JURNAL ILMIAH MATEMATIKA DAN TERAPAN Vol. 14 No. 2 (2017)
Publisher : Program Studi Matematika, Universitas Tadulako

IMPLEMENTASI ALGORITMA DYNAMIC PROGRAMMING PADA APLIKASIPERHITUNGAN BIAYA PRODUKSI PRODUK PERCETAKAN DENGANMENGGUNAKAN VISUAL BASIC(STUDI KASUS : CV. BRIZKY ADVERTISING)

ALGORITMA VAN AARDENNE-EHRENFEST DAN DE BRUIJN DALAM MENCARI SIRKUIT EULER PADA GRAF BERARAH UNTUK MEREKONSTRUKSI RANTAI RNA DARI G-FRAGMENTS DAN (U,C)-FRAGMENTS D Ismayasari; I W Sudarsana; I N Suwastika
JURNAL ILMIAH MATEMATIKA DAN TERAPAN Vol. 14 No. 2 (2017)
Publisher : Program Studi Matematika, Universitas Tadulako

ALGORITMA VAN AARDENNE-EHRENFEST DAN DE BRUIJN DALAM MENCARISIRKUIT EULER PADA GRAF BERARAH UNTUK MEREKONSTRUKSIRANTAI RNA DARI G-FRAGMENTS DAN (U,C)-FRAGMENTS

DETEKSI RABUN JAUH (MIOPIA) BERBASIS PENGOLAHAN CITRA DIGITAL MENGGUNAKAN METODE BWAREA C Anwar; I W Sudarsana; D Lusiyanti
JURNAL ILMIAH MATEMATIKA DAN TERAPAN Vol. 14 No. 2 (2017)
Publisher : Program Studi Matematika, Universitas Tadulako

DETEKSI RABUN JAUH (MIOPIA) BERBASIS PENGOLAHAN CITRA DIGITAL MENGGUNAKAN METODE BWAREA

PELABELAN L(d,2,1) PADA OPERASI KOMPLEMEN DAN KORONA GRAF LINTASAN DAN SIKLUS R Natalia; I W Sudarsana; S Musdalifah
JURNAL ILMIAH MATEMATIKA DAN TERAPAN Vol. 15 No. 1 (2018)
Publisher : Program Studi Matematika, Universitas Tadulako

Let be a graph with vertices and edges. An labeling of graph is a function of such that the following condition for where denoted the on distance of two vertices and and for . A number is called the span of labeling, if is the largest label vertex of labeling. Notation states that the smallest span of all labeling on a graph . An injective labeling is called and a minimum span of all labeling denoted by . A graph which has labeling is called the graph. In this paper we study of such labeling by considering complement of path and cycle. The result showed that complement of path has , for and , for and complement of the cycle has for and , for and corona of two paths has . Therefor, the complement of paths the complement of cycle , and corona of two path are graph.

PELABELAN GRACEFUL GANJIL PADA GRAF DUPLIKASI DAN SPLIT BINTANG J A Bantara; I W Sudarsana; S Musdalifah
JURNAL ILMIAH MATEMATIKA DAN TERAPAN Vol. 15 No. 1 (2018)
Publisher : Program Studi Matematika, Universitas Tadulako

Graph is not an empty a finite of the objects that called point (vertex) with the couple was not that is the side (edge). The set point denoted by , while the set edge denoted by . Odd graceful labeling on graph with side is a function injective from so that induced function such that in label with so label sides would be different. A graph that have an odd graceful labeling is called odd graceful graph. The result showed that duplicate star graph for and split star graph for , for even satisfie odd graceful labeling.

PELABELAN SELIMUT AJAIB SUPER PADA GRAF LINTASAN N Farida; I W Sudarsana; Resnawati Resnawati
JURNAL ILMIAH MATEMATIKA DAN TERAPAN Vol. 15 No. 2 (2018)
Publisher : Program Studi Matematika, Universitas Tadulako

Let ???? = (????, ????) be a simple graph. An edge covering of ???? is a family of subgraphs ????1 , … , ???????? such that each edge of ????(????) belongs to at least one of the subgraphs ???????? , 1 ≤ ???? ≤ ????. If every ???????? is isomorphic to a given graph ????, then the graph ???? admits an ???? − covering. Let ???? be a containing a covering ????, and ???? the bijectif function ????: (???? ∪ ????) → {1,2,3, … , |????| + |????|} is said an ???? −magic labeling of ???? if for every subgraph ???? ′ = (???? ′ ,???? ′ ) of ???? isomorphic to ????, is obtained that ∑ ????(????) + ∑ ????(????) ????∈????(????′ ????∈????(???? ) ′ ) is constant. ???? is said to be ???? −super magic if ????(????) = {1, 2, 3, … , |????|}. In this case, the graph ???? which can be labeled with ????-magic is called the covering graph ???? −magic. The sum of all vertex labels and all edge labels on the covering ???? − super magic then obtained constant magic is denoted by ∑ ????(????). The duplication graph 2 of graph ????2 (????) is a graph obtained from two copies of graph ????, called ???? and ???? ′ , with connecting each respectively vertex ???? in ???? with the vertexs immediate neighboring of ???? ′ in ???? ′ . The purpose of this study is to obtain a covering super magic labeling for of ????2 (????????) on (????2 (???????? )) for ???? ≥ 4 and 3 ≤ ???? ≤ ???? − 1. In this paper, we have showed that duplication path graph (????2 (???????? )) has ????2 (????????) covering super magic labeling for ???? ≥ 4 and 3 ≤ ???? ≤ ???? − 1 with constant magic for all covering is ∑ ????(????2 (????????) (????) ) = ∑ ????(????2 (????????) (????+1) )

RANCANG BANGUN SISTEM INFORMASI AKADEMIK FMIPA UNIVERSITAS TADULAKO BERBASIS ANDROID W F Prasetyo; I W Sudarsana; D Lusiyanti
JURNAL ILMIAH MATEMATIKA DAN TERAPAN Vol. 15 No. 2 (2018)
Publisher : Program Studi Matematika, Universitas Tadulako

Academic information system based on Android necessary to support the effectiveness management of academic data such as input card study plan and input the value of course. To build Siakad Android application, the authors do the research of the database web Siakad Faculty of Natural Science Tadulako University that includes all the data of students, faculty, courses, card study plan, and card study result. The purpose of this study was to obtain academic information system based on Android Tadulako University Faculty of Mathematics and Natural Sciences. This application is built with features such as view bio, view the result of study, view the transcript, input study plan card, input result study card, wait confirm of study plan, and confirm study plan. Based on the results and discussion, it can be concluded that academic information system can support the effectiveness of academic data processing, such as the study plan input, and the input value of the course.

Co-Authors A Sahari A T Manurung Abdi C Anwar D Ismayasari D Wahyuli Desy Lusiyanti Fadjriyani I N Suwastika Ikram Ikram Iman Setiawan J A Bantara J Khasmawati Junaidi Junaidi K Saleh N Farida N H Turilah N Mattiro N Mutmainna Nurjana Nurjana R Natalia Resnawati S Hendra S Musdalifah S Pranata W F Prasetyo Y Natalia

Title

Found 14 Documents
Search

Abstract

Abstract

Abstract

Abstract

Abstract

Abstract

Abstract

Abstract

Abstract

Abstract

Title Search

Found 14 Documents Search

Abstract

Abstract

Abstract

Abstract

Abstract

Abstract

Abstract

Abstract

Abstract

Abstract

Title

Found 14 Documents
Search