Zobrazeno 1 - 7
of 7
pro vyhledávání: '"Bowo Winarno"'
Autor:
Ratna Zakkiya Meilia Utami, Daniel Sugihantoro, Franses Patar Moses, Hafidz Dhany Wicaksono, Maulidah Nur Rizka, Tivano Antoni, Meyliana Adhitya Kusumawardhani, Siti Ummul Khoiroti, Tasya Saevita Nugroho, Yuliana Nuraini, Bowo Winarno
Publikováno v:
Jurnal Abdimas Prakasa Dakara, Vol 2, Iss 2, Pp 59-65 (2022)
Pandemi COVID-19 berdampak pada sektor kehidupan, termasuk pariwisata seperti Tawangmangu. Untuk meningkatkan jumlah wisatawan direncanakan program yang membantu mempromosikan potensi Kecamatan Tawangmangu kepada masyarakat secara luas dengan melakuk
Externí odkaz:
https://doaj.org/article/3af6da99f79245b9879b1e7e05cf5c7c
Publikováno v:
BAREKENG: Jurnal Ilmu Matematika dan Terapan. 14:511-522
A time series model that explain the structural changes associated with data in a certain time period is the Threshold Autoregressive (TAR) model. The basic of the TAR model there are some different usage regimes in autoregressive analysis. One model
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::55118abd0e8cf15fe5b3d1257783233b
https://doi.org/10.30598/barekengvol14iss4pp511-522
https://doi.org/10.30598/barekengvol14iss4pp511-522
Publikováno v:
INTERNATIONAL CONFERENCE OF MATHEMATICS AND MATHEMATICS EDUCATION (I-CMME) 2021.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::0af52a5431c42e907ec248273becc00c
https://doi.org/10.1063/5.0116566
https://doi.org/10.1063/5.0116566
Publikováno v:
THE THIRD INTERNATIONAL CONFERENCE ON MATHEMATICS: Education, Theory and Application.
A communication network is a series of communication devices that used to carry out communication activities represented by a directed graph D = (V, A) where V is the set of node and A is the set of channels on a network. Network coding is coding of
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::734fa26b34f8f9107e9b026ef2888f04
https://doi.org/10.1063/5.0039774
https://doi.org/10.1063/5.0039774
Publikováno v:
THE THIRD INTERNATIONAL CONFERENCE ON MATHEMATICS: Education, Theory and Application.
Let G be a connected graph with vertex set V(G) and egde set E(G). An edge irregular reflexive k-labeling is a function fe : E(G) → {1,2,…,ke} and a function fv : V(G) → {0,2,…, 2kv}, where k = max {ke, 2kv} of a graph G such that the weights
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::de12aa29154df8284de8bef752f69e94
https://doi.org/10.1063/5.0039337
https://doi.org/10.1063/5.0039337
Publikováno v:
Journal of Physics: Conference Series. 855:012037
Let G(V (G), E(G)) be a finite simple graph with |V (G)| = G and |E(G)| = eG . Let H be a subgraph of G. The graph G is said to be (a, d)-H-antimagic covering if every edge in G belongs to at least one of the subgraphs G isomorphic to H and there is
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::02d88c5f6f3a39dfcd536d98cafdcdda
https://doi.org/10.1088/1742-6596/855/1/012037
https://doi.org/10.1088/1742-6596/855/1/012037
Publikováno v:
Journal of Physics: Conference Series; 2017, Vol. 855 Issue 1, p1-1, 1p