Zobrazeno 1 - 10
of 15
pro vyhledávání: '"Kusbudiono Kusbudiono"'
Publikováno v:
JTAM (Jurnal Teori dan Aplikasi Matematika), Vol 8, Iss 2, Pp 568-577 (2024)
An inclusive distance vertex irregular labelling of a simple graph G is a function of the vertex set of to positive integer set such that the sum of its vertex label and the labels of all vertices adjacent to the vertex are distinct. The minimum of m
Externí odkaz:
https://doaj.org/article/d051fe302cd94a0e82c8857a3dd477c2
Publikováno v:
InPrime, Vol 5, Iss 1, Pp 1-21 (2023)
Abstract In this study, we model the transmission of COVID-19 by considering vaccination and quarantine interventions. The focus of our study is to measure the effect of these two interventions on controlling the spread of COVID-19. We demonstrate th
Externí odkaz:
https://doaj.org/article/4b3c662102e8475ea0b6c695f5e4017c
Publikováno v:
InPrime, Vol 4, Iss 1, Pp 24-32 (2022)
As science developed, heuristic methods began to be used in graph coloring. Heuristic methods that have been used for graph coloring include Genetic Algorithm, Tabu Search, and Ant Colony Algorithm. A Genetic Algorithm is a method for solving optimiz
Externí odkaz:
https://doaj.org/article/f7d337a7e9c94317a2f4603c1e482783
Publikováno v:
Jurnal EurekaMatika; Vol 11, No 1 (2023): Jurnal Eurekamatika; 33-46
Misalkan G=(V,E) adalah graf terhubung dan c adalah pewarnaan titik dengan t warna. Pewarnaan titik pada graf G adalah fungsi c:V(G)→{1,2,…,t}, sedemikian sehingga c(u)≠c(v) jika u dan v merupakan dua titik yang bertetangga. Apabila suatu graf
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=journalunive::89c5650eaa8b02f13fba65853405f3b1
https://ejournal.upi.edu/index.php/JEM/article/view/56969
https://ejournal.upi.edu/index.php/JEM/article/view/56969
Publikováno v:
Mathematics and Statistics. 8:58-62
The development of an increasingly rapid industrial development resulted in increasingly intense competition between industries. Companies are required to maximize performance in various fields, especially by meeting customer demand with agreed timel
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::8aba533cac8420d311266d61be6077d6
https://doi.org/10.13189/ms.2020.081310
https://doi.org/10.13189/ms.2020.081310
Publikováno v:
CGANT JOURNAL OF MATHEMATICS AND APPLICATIONS. 2
Misalkan $G=(V,E)$ adalah graf sederhana tidak berarah dan terhubung dengan himpunan titik $V$ dan himpunan sisi $E$. Himpunan $D\in V(G)$ dikatakan himpunan dominasi lokasi dari suatu graf terhubung $G$ jika setiap dua titik yang berbeda $u,v \in V(
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::19934a95a2c1e39e3e92781e3c2f12ac
https://doi.org/10.25037/cgantjma.v2i2.65
https://doi.org/10.25037/cgantjma.v2i2.65
Publikováno v:
Jurnal Pengabdian Masyarakat Applied. 1:63
Munculnya COVID 19 yang berkepenjangan menyebabkan pembelajaran di semua tingkat, termasuk pembelajaran di SMA, dilakukan secara daring. Dalam pembelajaran secara daring sangat dirasakan perlunya media pembelajaran yang memungkinkan siswa belajar sec
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::2346037fe6d17c60d04258aa55968bd7
https://doi.org/10.19184/jpma.v1i2.34765
https://doi.org/10.19184/jpma.v1i2.34765
Autor:
D. A. R. Wardani, Shinta Aditya Rachman, Kusbudiono Kusbudiono, Ika Hesti Agustin, Dafik Dafik
Publikováno v:
Far East Journal of Mathematical Sciences (FJMS). 116:11-24
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::503e38a65eea394122fecf997b6f509a
https://doi.org/10.17654/ms116010011
https://doi.org/10.17654/ms116010011
Publikováno v:
CGANT JOURNAL OF MATHEMATICS AND APPLICATIONS. 2
Let $G=(V(G),E(G))$ be a nontrivial connected graph. The edge coloring is defined as $c:E(G) \rightarrow \{1,2,...,k\}, k \in N$, with the condition that no adjacent edges have the same color. \emph{k}-color \emph{r}-dynamic is an edge coloring of \e
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::65fc52690e75da90fe3a911bcdce563a
https://doi.org/10.25037/cgantjma.v2i1.47
https://doi.org/10.25037/cgantjma.v2i1.47
Publikováno v:
CGANT JOURNAL OF MATHEMATICS AND APPLICATIONS. 2
Graph coloring began to be developed into coloring dynamic. One of the developments of dynamic coloring is $r$-dynamic total coloring. Suppose $G=(V(G),E(G))$ is a non-trivial connected graph. Total coloring is defined as $c:(V(G) \cup E(G))\rightarr
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::88367818985087a06d769d4d1ae97ecc
https://doi.org/10.25037/cgantjma.v2i1.51
https://doi.org/10.25037/cgantjma.v2i1.51