Article Per Year (5 Year)
p-Index From 2021 - 2026
4.506
P-Index
This Author published in this journals
All Journal Science and Technology Indonesia JMPM: Jurnal Matematika dan Pendidikan Matematika BAREKENG: Jurnal Ilmu Matematika dan Terapan Limits: Journal of Mathematics and Its Applications Eksakta : Berkala Ilmiah Bidang MIPA M A T H L I N E : Jurnal Matematika dan Pendidikan Matematika Jurnal Matematika UNAND Jurnal Saintika Unpam : Jurnal Sains dan Matematika Unpam InPrime: Indonesian Journal Of Pure And Applied Mathematics Warta Pengabdian Andalas: Jurnal Ilmiah Pengembangan Dan Penerapan Ipteks Jurnal Natural Limits: Journal of Mathematics and Its Applications
Des Welyyanti
Jurusan Matematika, FMIPA, Universitas Andalas
Agriculture, Biological Sciences & Forestry Astronomy Biochemistry, Genetics & Molecular Biology Chemical Engineering, Chemistry & Bioengineering Chemistry Civil Engineering, Building, Construction & Architecture Computer Science & IT Control & Systems Engineering Decision Sciences, Operations Research & Management Earth & Planetary Sciences Economics, Econometrics & Finance Education Energy Engineering Environmental Science Immunology & microbiology Materials Science & Nanotechnology Mathematics Mechanical Engineering Medicine & Pharmacology Neuroscience Physics Social Sciences Transportation Other

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

Found 53 Documents
Search

 2   3   4   5   6 
Bilangan Kromatik Lokasi Amalgamasi Sisi Graf Lingkaran $amal_s(C_n^j;v_{j,1}v_{j,n})$ dengan $n=3,4$, dan $m\geq2$ Welyyanti, Des; Daramenra, Romie; Yulianti, Lyra
Limits: Journal of Mathematics and Its Applications Vol. 22 No. 3 (2025): Limits: Journal of Mathematics and Its Applications Volume 22 Nomor 3 Edisi No
Publisher : Pusat Publikasi Ilmiah LPPM Institut Teknologi Sepuluh Nopember

Show Abstract | Download Original | Original Source | Check in Google Scholar

Abstract

Let G be a connected graph and {S_1,S_2,…,S_k} be an ordered partition of V(G). Let S_i is a set of color classes using colors 1,2,...,k where k as positive integer. The color code c_ (v) of vertex v in G with respect to  is defined as k-vector, c_ (v)=(d(v,S_1 ),d(v,S_2 ),…,d(v,S_i )) where d(v,S_i ). If each of vertices in G have distinct color codes, then c is called as locating coloring of G. The minimum number of colors that are used for locating coloring is called as locating chromatic number of G, denoted by X_L (G). 
The Locating Chromatic Number of Zigzag Graph Z_n Sagita Putri, Vella; Des Welyyanti; Haripamyu
InPrime: Indonesian Journal of Pure and Applied Mathematics Vol. 7 No. 2 (2025)
Publisher : Department of Mathematics, Faculty of Sciences and Technology, UIN Syarif Hidayatullah

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.15408/99cs0080

Abstract

The locating chromatic number is a concept developed from vertex coloring and the partition dimension of a graph, first studied by Chartrand et al. (2002). A connected graph G is said to have a locating coloring when each vertex is assigned a color such that the resulting color code defined by its distances to every color class is unique. The minimum number of colors that satisfies this condition is known as the locating chromatic number, denoted by χ_L (G). This study investigates the value of χ_L for the zigzag graph Z_n with n≥3. Although colorings have been studied for various families of graphs, no explicit characterization of zigzag graphs has been established. Our analysis shows that Z_3 has a locating chromatic number of 3, while for all n≥4, the value increases to 4. These results provide the first complete characterization of locating colorings on zigzag graphs and contribute to the broader study of location-based parameters in graphs with structured topology.Keywords: Locating chromatic number; Zigzag graph; Color code. AbstrakBilangan kromatik lokasi merupakan konsep pengembangan dari pewarnaan titik dan dimensi partisi suatu graf yang pertama kali dikaji oleh Chartrand dkk (2002). Sebuah graf terhubung Gdikatakan memiliki pewarnaan lokasi apabila setiap titik diberi warna sedemikian rupa sehingga kode warna yang dibentuk berdasarkan jaraknya terhadap setiap kelas warna bersifat unik. Banyaknya warna minimum yang memenuhi kondisi tersebut disebut bilangan kromatik lokasi, dilambangkan dengan χ_L (G). Penelitian ini mengkaji nilai χ_L pada graf zig-zag Z_n untuk n≥3. Walaupun sejumlah keluarga graf telah diteliti sebelumnya dalam konteks pewarnaan lokasi, graf zig-zag belum pernah memperoleh karakterisasi yang jelas. Hasil analisis menunjukkan bahwa Z_3 memiliki bilangan kromatik lokasi adalah 3, sedangkan untuk semua n≥4, nilai tersebut menjadi 4. Temuan ini memberikan karakterisasi lengkap pertama untuk pewarnaan lokasi pada graf zig-zag dan memperkaya kajian mengenai parameter lokasi pada graf dengan struktur khusus.Kata Kunci: Bilangan kromatik lokasi; Graf zig-zag; Kode warna. 2020MSC: 05C12, 05C15.
The Locating Chromatic Number of Pentagonal Circular Ladder Graph PCLn Des Welyyanti; Wahyuni, Annisa; Haripamyu
InPrime: Indonesian Journal of Pure and Applied Mathematics Vol. 7 No. 2 (2025)
Publisher : Department of Mathematics, Faculty of Sciences and Technology, UIN Syarif Hidayatullah

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.15408/tt7bzq90

Abstract

Locating coloring is a type of vertex coloring applied to connected graphs, where each vertex is assigned a color such that adjacent vertices receive different colors. In this setting, each color corresponds to a color class, which consists of all vertices assigned that color. A central notion in locating coloring is the color code of a vertex, determined by its distances to each color class. A coloring is classified as a locating coloring when every vertex in the graph has a unique color code. The locating chromatic number of a graph is the minimum number of colors needed to achieve such a coloring. The Pentagonal Circular Ladder graph is a structure formed by combining a circular graph with pentagonal components. This article examines the locating chromatic number of the Pentagonal Circular Ladder graph and provides an analysis of the behavior of locating colorings within this graph family.Keywords: Locating chromatic number; Partition; Locating coloring; Color code; Pentagonal Circular Ladder Graph. AbstrakPewarnaan lokasi merupakan jenis pewarnaan titik yang diterapkan pada graf terhubung, di mana setiap titik diberi warna sehingga titik-titik yang bertetangga tidak memiliki warna yang sama. Dalam konteks ini, setiap warna membentuk sebuah kelas warna yang terdiri atas seluruh titik yang diberi warna tersebut. Salah satu konsep utama dalam pewarnaan lokasi adalah kode warna suatu titik, yang ditentukan berdasarkan jaraknya terhadap setiap kelas warna. Suatu pewarnaan disebut pewarnaan lokasi apabila setiap titik dalam graf memiliki kode warna yang berbeda. Bilangan kromatik lokasi dari suatu graf didefinisikan sebagai jumlah minimum warna yang diperlukan untuk menghasilkan pewarnaan semacam ini. Graf Pentagonal Circular Ladder merupakan struktur graf yang dibentuk melalui penggabungan graf lingkaran dengan komponen-komponen pentagonal. Artikel ini mengkaji bilangan kromatik lokasi dari graf Pentagonal Circular Ladder serta memberikan analisis mengenai perilaku pewarnaan lokasi pada keluarga graf tersebut.Kata Kunci: Bilangan kromatik lokasi; Partisi; Pewarnaan lokasi; Kode warna; Graf Pentagonal Circular Ladder. 2020MSC: 05C12, 05C15.
Co-Authors Abdi Musra Abdurrahman, Fatih Abel, Latifa Azhar ADEK HAYATI PUTRI Admi Nazra Afrianti Afrianti Aisyah Nurinsani Alifaziz Arsyad Alifaziz Arsyad Angryanof, Uthary Putri Citra Mayora Daramenra, Romie Devianto, Dodi Efendi Efendi Effendi Effendi Eka Rahayu Nengsih A ELIZIA AUGUSTIN Elva Rahimah Fadhila Radiah Anas Fajri, Muhammad Rafif Fakhri Zikra Febria Angraini Fitri - Anggalia Hamdi, Muhammad Haripamyu Haripamyu Hazmira Yozza Ikhlas Pratama Sandy Kelson Novrianus Lessya KIKI KHAIRA MARDIMAR Laila Hidayati Laila Hidayati Lessya, Kelson Novrianus Mardimar, Kiki Khaira Mega Silvia Meiza Fiqrul Hanif MELATI NUR mellany mellany Mellany, Mellany Muhammad Rafif Fajri MUHAMMAD RANDA Muthia Muhana Mutiara Ramadhani Syafnur Nada Andriani Nada Andriani Narwen Narwen Noverina Alfiany Nurinsani, Aisyah Nurwijayanti Permana, Dony REFI ALKADAR Rendy Aditya Pratama RUVIQA PUTRI SOLEHA Sagita Putri, Vella Suci Rahma Putri Sugesti Sugesti SUTANTO, DASA Sutra Lidya Pritama Syafruddin . Tika Apriliza Uthary Putri Angryanof Wahyuni, Annisa Yanita Yanita Yanuar, Ferra Yulianti, Lyra Zahara Zahara ZULKARNAIN, DEBI