Zobrazeno 1 - 10
of 71
pro vyhledávání: '"Hilda Assiyatun"'
Publikováno v:
Jurnal Matematika UNAND, Vol 13, Iss 4, Pp 340-348 (2024)
Misalkan G = (V;E) adalah graf sederhana dan terhubung. Untuk suatu himpunan R = fr1; r2; : : : ; rkg V dan v 2 V , representasi titik v terhadap R adalah vektor r(vjR) = (d(v; r1); d(v; r2); : : : ; d(v; rk)) dimana d(v; r) menyatakan jarak titik v
Externí odkaz:
https://doaj.org/article/7356846690cc4d38bf3aaecb62e7cfd8
Publikováno v:
Electronic Journal of Graph Theory and Applications, Vol 10, Iss 1, Pp 289-299 (2022)
Let F, G and H be simple graphs. The notation F → (G, H) means that for any red-blue coloring on the edges of graph F, there exists either a red copy of G or a blue copy of H. A graph F is called a Ramsey (G, H)-minimal graph if it satisfies two co
Externí odkaz:
https://doaj.org/article/12c4008c61c042ae849c311ca3f797b4
Publikováno v:
Indonesian Journal of Combinatorics, Vol 4, Iss 2, Pp 126-132 (2020)
The investigation on the locating-chromatic number of a graph was initiated by Char- trand et al. (2002). This concept is in fact a special case of the partition dimension of a graph. This topic has received much attention. However, the results are s
Externí odkaz:
https://doaj.org/article/9485c44b182a46d095c8d65589bb10f4
Publikováno v:
Heliyon, Vol 6, Iss 6, Pp e03843- (2020)
For any graphs F,G, and H, the notation F→(G,H) means that any red-blue coloring of all edges of F will contain either a red copy of G or a blue copy of H. The set R(G,H) consists of all Ramsey (G,H)-minimal graphs, namely all graphs F satisfying F
Externí odkaz:
https://doaj.org/article/7cb1c7b6944241a8a4bd36fbdf3846bb
Publikováno v:
AKCE International Journal of Graphs and Combinatorics, Vol 15, Iss 2, Pp 174-186 (2018)
Let and be simple graphs. We write to mean that any red–blue coloring of all edges of will contain either a red copy of or a blue copy of A graph (without isolated vertices) satisfying and for each is called a Ramsey -minimal graph. The set of all
Externí odkaz:
https://doaj.org/article/aa95e90b91d145cab1c419bb0f42e2b7
Publikováno v:
Electronic Journal of Graph Theory and Applications, Vol 7, Iss 1 (2019)
Let F, G, and H be simple graphs. The notation F → (G, H) means that if all the edges of F are arbitrarily colored by red or blue, then there always exists either a red subgraph G or a blue subgraph H. The size Ramsey number of graph G and H, denot
Externí odkaz:
https://doaj.org/article/cb961eb356ea4114b0b55014da90533e
Autor:
Hilda Assiyatun, Awanga Dijayangrana
Publikováno v:
Pattimura Proceeding: Conference of Science and Technology. :223-228
Kemampuan matematika siswa di Indonesia mengalami penurunan, hal ini didasari hasil PISA Indonesia yang mengalami penurunan dari sebelumnya memiliki skor 386 menjadi 379 [2]. Zaskiz [5] berpendapat bahwa terdapat celah antara hubungan aritmatika dan
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::9211b6ef110fba0bdd1cbf1776f88ad5
https://doi.org/10.30598/pattimurasci.2021.knmxx.223-228
https://doi.org/10.30598/pattimurasci.2021.knmxx.223-228
Publikováno v:
Pattimura Proceeding: Conference of Science and Technology. :265-270
Penilaian jawaban esai merupakan metode penilaian yang sering dilakukan oleh guru untuk mengevaluasi pembelajaran para siswa. Namun, pada kenyataannya, penerapan metode ini seringkali justru menghabiskan waktu guru yang seharusnya meluangkan waktu le
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::91394dfae3f032a14601157d5fbd7afb
https://doi.org/10.30598/pattimurasci.2021.knmxx.265-270
https://doi.org/10.30598/pattimurasci.2021.knmxx.265-270
Publikováno v:
Journal of Mathematical and Fundamental Sciences, Vol 48, Iss 1, Pp 39-47 (2016)
The locating-chromatic number of a graph G can be defined as the cardinality of a minimum resolving partition of the vertex set V(G) such that all vertices have distinct coordinates with respect to this partition and every two adjacent vertices in G
Externí odkaz:
https://doaj.org/article/35e9dbcfcf1a45a6a0f3ccb9c83446a2
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