Zobrazeno 1 - 10
of 19
pro vyhledávání: '"Rismawati Ramdani"'
Publikováno v:
Kubik, Vol 7, Iss 1, Pp 31-37 (2022)
Let be a graph and k be a positive integer. A vertex k-labeling is called an edge irregular labeling if there are no two edges with the same weight, where the weight of an edge uv is . The edge irregularity strength of G, denoted by es(G), is the min
Externí odkaz:
https://doaj.org/article/3b9defa2089f40e787bd77478d49258f
Publikováno v:
Kubik, Vol 6, Iss 2, Pp 110-119 (2022)
Measurement data is often used in determining the quality of a product. Some of the results in measurement present multivariate properties, meaning that there are many characteristics of quality. Many variables are measured to be used as a reference
Externí odkaz:
https://doaj.org/article/fade224f4cb9432682a1e4d48a472eaa
Autor:
Rismawati Ramdani
Publikováno v:
Indonesian Journal of Combinatorics, Vol 3, Iss 2, Pp 79-94 (2020)
Let G = (V(G),E(G)) be a graph and k be a positive integer. A total k-labeling of G is a map f : V ∪ E → {1,2,3,...,k}. The vertex weight v under the labeling f is denoted by w_f(v) and defined by w_f(v) = f(v) + \sum_{uv \in{E(G)}} {f(uv)}. A to
Externí odkaz:
https://doaj.org/article/63a1056af88940f8820bbd40453098d3
Publikováno v:
Journal of Mathematical and Fundamental Sciences, Vol 47, Iss 3, Pp 281-295 (2015)
Let 𝐺 = (𝑉, 𝐸) be a graph. A total labeling 𝑓: 𝑉 ∪ 𝐸 → {1, 2, ⋯ , 𝑘} is called a totally irregular total 𝑘-labeling of 𝐺 if every two distinct vertices 𝑥 and 𝑦 in 𝑉 satisfy 𝑤𝑓(𝑥) ≠ 𝑤𝑓(𝑦) a
Externí odkaz:
https://doaj.org/article/ec11d663af8b49dda4cf50b3f12f6b70
Publikováno v:
Kubik, Vol 1, Iss 1, Pp 38-48 (2015)
Misalkan G merupakan suatugraf dengan banyaknya titik pdan banyaknya sisi q. Pelabelan super graceful adalah pemetaan fungsi satu-satu pada f ∶ V(G) ∪ E(G) → {1,2, ... , p + q}sehingga f(uv) = |f(u) − f(v)| berbeda untuk setiap sisi uv ∈ E(
Externí odkaz:
https://doaj.org/article/b80bd409a95642c59818b5ecec52f2f1
Publikováno v:
PROCEEDINGS OF THE SYMPOSIUM ON ADVANCE OF SUSTAINABLE ENGINEERING 2021 (SIMASE 2021): Post Covid-19 Pandemic: Challenges and Opportunities in Environment, Science, and Engineering Research.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::acc52ab15d5525af52386ae9ffcd677d
https://doi.org/10.1063/5.0117163
https://doi.org/10.1063/5.0117163
Publikováno v:
Journal of the Indonesian Mathematical Society. :314-324
Let $G=(V(G),E(G))$ be a graph and $k$ be a positive integer. A total $k$-labeling of $G$ is a map $f: V(G)\cup E(G)\rightarrow \{1,2,\ldots,k \}$. The edge weight $uv$ under the labeling $f$ is denoted by $w_f(uv)$ and defined by $w_f(uv)=f(u)+f(uv)
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::bf55eb097b4a263fe96e69df70edce88
https://doi.org/10.22342/jims.25.3.828.314-324
https://doi.org/10.22342/jims.25.3.828.314-324
Publikováno v:
Journal of Physics: Conference Series. 1869:012143
Let G be a graph with q edges. A labelling f of G is said to be root square mean labelling if f: V(G)UE(G)→{1,2,…,q+1} such that when each edge e = uv labelled with f(e)=[f(u)2+f(v)2/2] or f(e)=[f(u)2+f(v)2/2] then the resulting edge labels are d
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::83dc7f51535b4058a2a9a009054ce94d
https://doi.org/10.1088/1742-6596/1869/1/012143
https://doi.org/10.1088/1742-6596/1869/1/012143
Publikováno v:
Journal of Physics: Conference Series. 1402:077099
Let G = (V (G),E(G)) be a graph and k be a positive integer. A total k-labeling of G is a map f: V (G) ∪ E(G) → {1, 2,…,k}. The vertex weight v under the labeling f is denoted by wf(v) and defined by wf(v) = f(v) + ∑ υν∈E(G)f(ν∈). A to
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::3126c79ade4f559b1097d8c282a0e42f
https://doi.org/10.1088/1742-6596/1402/7/077099
https://doi.org/10.1088/1742-6596/1402/7/077099
Autor:
Rismawati Ramdani, Martin Bača, Hilda Assiyatun, Andrea Semaničová-Feňovčíková, A. N. M. Salman
Publikováno v:
Mathematics in Computer Science. 9:229-237
We deal with the totally irregular total labeling which is required to be at the same time vertex irregular total and also edge irregular total. The minimum k for which a graph G has a totally irregular total k-labeling is called the total irregulari
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::b3d4ab0a763a00ff9e45c6a7d1e5b9f5
https://doi.org/10.1007/s11786-015-0229-x
https://doi.org/10.1007/s11786-015-0229-x