Zobrazeno 1 - 10
of 20
pro vyhledávání: '"I W Sudarsana"'
Autor:
Ikram Ikram, null Abdi, N Mutmainna, J Khasmawati, D Wahyuli, I W Sudarsana, null Junaidi, null Fadjriyani, I Setiawan, S Hendra
Publikováno v:
JURNAL ILMIAH MATEMATIKA DAN TERAPAN. 19:168-179
Batik merupakan salah satu warisan seni budaya bangsa Indonesia yang ada untuk terus dipertahankan dan dikembangkan. Upaya ini dilakukan dengan memperbanyak motif--motif baru yang salah satunya dengan mengekplorasi keunikan alam yang ada. Alam Sulawe
Publikováno v:
International Journal of Mathematics and Mathematical Sciences, Vol 2019 (2019)
A simple graph G=(V,E) is said to be an H-covering if every edge of G belongs to at least one subgraph isomorphic to H. A bijection f:V∪E→{1,2,3,…,V+E} is an (a,d)-H-antimagic total labeling of G if, for all subgraphs H′ isomorphic to H, the
Externí odkaz:
https://doaj.org/article/fbac3904a7f94e019ed2d4bf143e240b
Autor:
I W Sudarsana, N Mattiro
Publikováno v:
JURNAL ILMIAH MATEMATIKA DAN TERAPAN. 18:95-109
Let be a simple graph. An edge covering of is a family of subgraphs such that each edge of graph belongs to at least one of the , subgraphs. If each is isomorphic with the given graph , then it is said that contains a covering. The graph G contains a
Publikováno v:
JURNAL ILMIAH MATEMATIKA DAN TERAPAN. 17:191-201
Meatballs are foods made from meat, shrimp, fish chopped and crushed together with starch and egg white, usually formed roundly. Meatballs have health benefits for the human body because of the content contained in animal protein, vitamins and fat. H
Publikováno v:
JURNAL ILMIAH MATEMATIKA DAN TERAPAN. 16:33-41
Passenger waiting time is the time required by passengers starting from the stops until getting transport. The purpose of this research is to get the model of waiting time passengers on the freight line in the Palu city. The first step is the prepara
Publikováno v:
JURNAL ILMIAH MATEMATIKA DAN TERAPAN. 15:118-129
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 isomor
Publikováno v:
JURNAL ILMIAH MATEMATIKA DAN TERAPAN. 15:157-172
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 datab
Publikováno v:
JURNAL ILMIAH MATEMATIKA DAN TERAPAN. 15:11-19
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
Publikováno v:
JURNAL ILMIAH MATEMATIKA DAN TERAPAN. 15:28-35
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
Publikováno v:
JURNAL ILMIAH MATEMATIKA DAN TERAPAN. 14:137-143
IMPLEMENTASI ALGORITMA DYNAMIC PROGRAMMING PADA APLIKASIPERHITUNGAN BIAYA PRODUKSI PRODUK PERCETAKAN DENGANMENGGUNAKAN VISUAL BASIC(STUDI KASUS : CV. BRIZKY ADVERTISING)