Zobrazeno 1 - 10
of 25
pro vyhledávání: '"Hinding, Nurdin"'
Publikováno v:
In Heliyon November 2022 8(11)
Publikováno v:
In Heliyon June 2022 8(6)
Autor:
Hinding, Nurdin, Firmayasari, Dian, Basir, Hasmawati, Bača, Martin, Semaničová-Feňovčíková, Andrea
Publikováno v:
In AKCE International Journal of Graphs and Combinatorics December 2018 15(3):291-297
Autor:
Hinding, Nurdin1 (AUTHOR), Kim, Hye Kyung2 (AUTHOR), Sunusi, Nurtiti3 (AUTHOR), Mise, Riskawati4 (AUTHOR)
Publikováno v:
International Journal of Mathematics & Mathematical Sciences. 1/23/2021, p1-9. 9p.
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.
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.
Autor:
Hinding, Nurdin
In this paper we investigate the total edge irregularity strength tes(G) and the total vertex irregularity strength tvs(G) of diamond graphs Br_n and prove that tes(Br_n) =???(5n ??? 3)/3???, while tvs(Br) =???(n + 1)/3???.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od______2356::e89f7baabe8c5b1ba4674a83c4b378ba
http://repository.unhas.ac.id/handle/123456789/26198
http://repository.unhas.ac.id/handle/123456789/26198
Autor:
Hinding, Nurdin
Previous results related to the concepts of the total irregular labeling of a graph indicate that the butterfly net work was one of some graphs which have not been specified in term of the total irregularit y strengths. This paper aimed to determine
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od______2356::5c5dfe7672f1a8ac7973f907b5b89fbf
http://repository.unhas.ac.id/handle/123456789/26191
http://repository.unhas.ac.id/handle/123456789/26191
The aims of this research is study a point process model for rainfall occurrence. The model is a renewal process. In this model, the rainfall occurrence is considered by the random point in a space, where every point denoted by time or/and location o
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od______2356::e6ea4e6407d80f5c9ae7b2d483299abc
http://repository.unhas.ac.id/handle/123456789/15011
http://repository.unhas.ac.id/handle/123456789/15011
Autor:
Hinding, Nurdin
The total edge irregularity strength of any graph G is the minimum integer number k such that G have a total edge irregular k- labeling. In this paper we find that the total edge irregularity of web graph is ???((2m+1)n+2)/3??? for m???2 and n???3.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od______2356::f36c5ec6beeb8c9cf39af86992f4019a
http://repository.unhas.ac.id/handle/123456789/13254
http://repository.unhas.ac.id/handle/123456789/13254