Zobrazeno 1 - 10
of 151
pro vyhledávání: '"D. Dafik"'
Autor:
Arika Indah Kristiana, M. Hidayat, Robiatul Adawiyah, D. Dafik, Susi Setiawani, Ridho Alfarisi
Publikováno v:
Ural Mathematical Journal, Vol 8, Iss 2 (2022)
Let \(G=(V,E)\) be a graph with a vertex set \(V\) and an edge set \(E\). The graph \(G\) is said to be with a local irregular vertex coloring if there is a function \(f\) called a local irregularity vertex coloring with the properties: (i) \(l:(V(G)
Externí odkaz:
https://doaj.org/article/bb674d9a115c4b97a9838c9a330634f8
Publikováno v:
Indonesian Journal of Combinatorics, Vol 3, Iss 1, Pp 14-23 (2019)
This paper is aimed to study the use of super (a, d)-H antimagic total graph on generating encryption keys that can be used to establish a stream cipher. Methodology to achieve this goal was undertaken in three steps. First of all the existence of su
Externí odkaz:
https://doaj.org/article/b4e01c71b530475fb73f76fd63fe3b43
Publikováno v:
Indonesian Journal of Combinatorics, Vol 2, Iss 1, Pp 30-34 (2018)
The local antimagic labeling on a graph G with |V| vertices and |E| edges is defined to be an assignment f : E --> {1, 2,..., |E|} so that the weights of any two adjacent vertices u and v are distinct, that is, w(u)̸ ̸= w(v) where w(u) = Σe∈E(u)
Externí odkaz:
https://doaj.org/article/b9d00742f195407e91c15eff3828d125
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Publikováno v:
Indonesian Journal of Combinatorics, Vol 1, Iss 1, Pp 22-30 (2016)
Let $G$ be a simple, connected and undirected graph. Let $r,k$ be natural number. By a proper $k$-coloring of a graph $G$, we mean a map $ c : V (G) \rightarrow S$, where $|S| = k$, such that any two adjacent vertices receive different colors. An $r$
Externí odkaz:
https://doaj.org/article/cd6d66d6ca5f484585965ae1346e892d
Publikováno v:
Mathematics and Computers in Simulation. 191:168-186
This paper is concerned with the problem of global synchronization for a class of uncertain fractional-order bidirectional associative memory (FOBAM) neural networks (NNs) with constant time delay. Some linear matrix inequality (LMI) based conditions
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::2102d97c204fda92c25b7b3767ba0155
https://doi.org/10.1016/j.matcom.2021.08.001
https://doi.org/10.1016/j.matcom.2021.08.001
Publikováno v:
5th INTERNATIONAL CONFERENCE ON CURRENT SCENARIO IN PURE AND APPLIED MATHEMATICS (ICCSPAM-2022).
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::c79fb79bbcbb2f0339f001bbf78cd90d
https://doi.org/10.1063/5.0137794
https://doi.org/10.1063/5.0137794
Publikováno v:
5th INTERNATIONAL CONFERENCE ON CURRENT SCENARIO IN PURE AND APPLIED MATHEMATICS (ICCSPAM-2022).
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::91d8ee2f674bd88ba9f784043ec8782e
https://doi.org/10.1063/5.0137003
https://doi.org/10.1063/5.0137003
Publikováno v:
Jurnal Ilmu Dasar, Vol 15, Iss 2, Pp 123-130 (2015)
Let G be a simple graph of order p and size q. Graph G is called an (a,d)-edge-antimagic totalifthereexistabijectionf :V(G)∪E(G)→{1,2,...,p+q}suchthattheedge-weights,w(uv)= f(u)+f(v)+f(uv); u, v ∈ V (G), uv ∈ E(G), form an arithmetic sequence
Externí odkaz:
https://doaj.org/article/9edd3a096b614d6bb56756d275ea6d19
Autor:
Arika Indah Kristiana, Indah Lutfiyatul Mursyidah, D. Dafik, Robiatul Adawiyah, Ridho Alfarisi
Publikováno v:
Discrete Mathematics, Algorithms and Applications.
Let [Formula: see text] be a simple graph and connected. A function [Formula: see text] is called vertex irregular [Formula: see text]-labeling and [Formula: see text] where [Formula: see text] The function of [Formula: see text] is called local irre
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::1ed7c1003aa4c34a33a8e90fee18c624
https://doi.org/10.1142/s1793830922501488
https://doi.org/10.1142/s1793830922501488