Article Per Year (5 Year)
p-Index From 2021 - 2026
0.444
P-Index
This Author published in this journals
All Journal Jurnal Saintika Unpam : Jurnal Sains dan Matematika Unpam Limits: Journal of Mathematics and Its Applications
Syafrizal Sy
Universitas Andalas
Chemistry Computer Science & IT Decision Sciences, Operations Research & Management Mathematics Physics

Published : 2 Documents Claim Missing Document
Claim Missing Document
Check
Articles

Found 2 Documents
Search

 1 
BILANGAN RAMSEY MULTIPARTIT UKURAN UNTUK GRAF POHON DAN GRAF LINTASAN Yerti Syahraini Putri; Effendi Effendi; Syafrizal Sy
JURNAL SAINTIKA UNPAM Vol 3, No 2 (2021)
Publisher : Program Studi Matematika FMIPA Universitas Pamulang

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.32493/jsmu.v3i2.6675

Abstract

Misalkan j,l,n,s dan t adalah bilangan-bilangan asli dengan n,s≥2 dan j,l,t≥1 maka bilangan Ramsey multipartit ukuran m_j (K_(n×l),K_(s×t) )  adalah bilangan asli terkecil ξ sedemikian sehingga sebarang pewarnaan dari semua sisi K_(j×ξ)  menggunakan dua warna merah dan biru, akan selalu berlaku bahwa K_(j×ξ) memuat K_(n×l)  merah atau K_(s×t) biru sebagai subgraf. Untuk sebarang graf G dan H, j≥2 adalah bilangan bulat, bilangan Ramsey multipartit ukuran m_j (G,H)  adalah bilangan asli terkecil ξ sedemikian sehingga setiap faktorisasi dari graf K_(j×ξ)≔F_1⊕F_2 memenuhi kondisi berikut:  F_1 memuat subgraf G atau F_2 memuat subgraf H. Dalam makalah ini, akan ditentukan nilai-nilai dari bilangan Ramsey multipartit ukuran m_j (T_n,P_3 )  untuk j≥3. Hasil pada penelitian ini menunjukkan bahwa bilangan Ramsey multipartit ukuran untuk graf pohon dan graf lintasan, untuk sebarang bilangan bulat positif n dan j≥3, yaitu m_3 (T_n,P_3 )=⌈n/3⌉, m_4 (T_n,P_3 )=⌈n/4⌉, dan m_3 (T_j,P_3 )=⌈n/j⌉.
Bilangan Kromatik Lokasi Graf Tentakel Azizah Riana Putri; Syafrizal Sy; Monika Rianti Helmi
Limits: Journal of Mathematics and Its Applications Vol. 22 No. 2 (2025): Limits: Journal of Mathematics and Its Applications Volume 22 Nomor 2 Edisi Ju
Publisher : Pusat Publikasi Ilmiah LPPM Institut Teknologi Sepuluh Nopember

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.12962/limits.v22i2.3462

Abstract

The locating-chromatic number of a graph was introduced by Chartrand et al. in 2002, which is a combined concept between the vertex coloring and partition dimension of a graph. The locating-chromatic number of a graph is a grouping of vertices on a graph based on color, which is called a color class, provided that each vertex on the graph has a different color code. Determining the locating-chromatic number of a graph is done by constructing the lower and upper bound of the locating-chromatic number of the graph. In this paper, we determine the locating-chromatic number of the tentacle graph, which is denoted by T_(k,m,n). Tentacle Graph is a graph constructed from a triangular book graph Bt_n whose common edge is amalgamated with C_k. Then two vertices in C_k that are adjacent to the vertex associated with the terminal edge are amalgamated with the star graphs S_(n_1) and S_(n_2). By determining the lower and upper bounds of the location chromatic number, it is obtained that the location chromatic number of Tentacle Graph is 4, m=1,n=2, n+1, for m>=1, n>= m + 2, and m + 2, for m > 1, n < m + 2.
Co-Authors Azizah Riana Putri Effendi Effendi Helmi, Monika Rianti Yerti Syahraini Putri