Zobrazeno 1 - 10
of 10
pro vyhledávání: '"Diah Junia Eksi Palupi"'
Publikováno v:
Mathematics, Vol 10, Iss 15, p 2577 (2022)
A binary modified de Bruijn sequence is an infinite and periodic binary sequence derived by removing a zero from the longest run of zeros in a binary de Bruijn sequence. The minimal polynomial of the modified sequence is its unique least-degree chara
Externí odkaz:
https://doaj.org/article/23c2e026bac64e459653f38ec622cba6
Autor:
Diah Junia Eksi Palupi
Publikováno v:
Far East Journal of Mathematical Sciences (FJMS). :101-110
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::339bd85fd91ef33ddd74f3f42112ea58
https://doi.org/10.17654/ms124020101
https://doi.org/10.17654/ms124020101
Publikováno v:
Far East Journal of Mathematical Sciences (FJMS). 108:253-272
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::01a693cad71ce813144dbfb6b6d42001
https://doi.org/10.17654/ms108020253
https://doi.org/10.17654/ms108020253
Publikováno v:
AIP Conference Proceedings.
Let G(V, E) be a finite, simple and undirected graph with a vertex set V and an edge set E. An edge irregular total k-labeling is a map f : V ∪ E → {1, 2, …, k} such that for any two different edges xy and x’y’ in E, ω(xy) ≠ ω(x’y’)
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ffcc4616f995d9e8572ca15303e52c5c
https://doi.org/10.1063/1.5139139
https://doi.org/10.1063/1.5139139
Publikováno v:
Journal of Mathematics Research. 13:16
Let G(V, E) be a simple, undirected, and finite graph with a vertex set V and an edge set E. An edge irregular total k-labelling is a function f from the set V \cup E to the set of non-negative integer set (1, 2, ... , k) such that any two different
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::3c77d90780e92bbb29e8708925f6d54b
https://doi.org/10.5539/jmr.v13n1p16
https://doi.org/10.5539/jmr.v13n1p16
Publikováno v:
ITM Web of Conferences, Vol 36, p 03004 (2021)
LetG= (V, E)be a finite, simple and undirected graph with a vertex setVand an edge setE. An edge irregular totalk-labelling is a functionf : V ᴗE → {1,2,…,k}such that for any two different edgesxyandx’y’inE, their weights are distinct. The
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::eebce970869898cef9d1de823ed03133
https://doi.org/10.1051/itmconf/20213603004
https://doi.org/10.1051/itmconf/20213603004
Publikováno v:
Journal of Physics: Conference Series. 1722:012028
Let G(V, E) be a finite, simple and undirected graph with a vertex set V and an edge set E. An edge irregular total k-labeling is a map f : V ⋃ E → {1, 2, …, k} such that for any two different edges xy and x′y′ in E, ω(xy) ≠ ω(x′y′)
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::c3237ffff22e25f1fb964156a9586a4a
https://doi.org/10.1088/1742-6596/1722/1/012028
https://doi.org/10.1088/1742-6596/1722/1/012028
Publikováno v:
International Journal of Mathematical Analysis. 9:2319-2326
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::bba7550865b868461f736997744f9314
https://doi.org/10.12988/ijma.2015.56175
https://doi.org/10.12988/ijma.2015.56175
Publikováno v:
Journal of Physics: Conference Series. 1306:012032
For any simple undirected graph G(V, E), a map f : V ⋃ E → {1, 2, …, k} such that for any different edges xy and x’y’ their weights are distinct is called an edge irregular total k-labeling. The weight of edge xy is defined as the sum of ed
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::8a21bf70b8516ac798b754d1e7a6390c
https://doi.org/10.1088/1742-6596/1306/1/012032
https://doi.org/10.1088/1742-6596/1306/1/012032
Publikováno v:
Journal of Physics: Conference Series; 2019, Vol. 1306 Issue 1, p1-1, 1p