Article Per Year (5 Year)
p-Index From 2021 - 2026
4.426
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 Jambura Journal of Mathematics Jurnal Hilirisasi IPTEKS (JHI) Eksakta : Berkala Ilmiah Bidang MIPA Indonesian Journal of Combinatorics Jurnal Matematika UNAND Jurnal Lebesgue : Jurnal Ilmiah Pendidikan Matematika, Matematika dan Statistika Jurnal Natural Limits: Journal of Mathematics and Its Applications
Yulianti, Lyra
Department Of Mathematics And Data Science, Faculty Of Mathematics And Natural Sciences, Universitas Andalas, Indonesia
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 Dentistry Earth & Planetary Sciences Economics, Econometrics & Finance Education Energy Engineering Environmental Science Health Professions Immunology & microbiology Materials Science & Nanotechnology Mathematics Mechanical Engineering Neuroscience Physics Public Health Transportation Veterinary Other

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

Found 55 Documents
Search

 2   3   4   5   6 
On Ramsey (mK2,bPn)-minimal Graphs Nadia Nadia; Lyra Yulianti; Fawwaz Fakhrurrozi Hadiputra
Indonesian Journal of Combinatorics Vol 7, No 1 (2023)
Publisher : Indonesian Combinatorial Society (InaCombS)

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.19184/ijc.2023.7.1.2

Abstract

Let G and H be two given graphs. The notation F→(G,H) means that any red-blue coloring on the edges of F will create either a red subgraph G or a blue subgraph H in F. A graph F is a Ramsey (G,H)-minimal graph if F satisfies two conditions: (1) F→(G,H), and (2) (F−e) ⇸ (G,H) for every e ∈ E(F). Denote ℜ(G,H) as the set of all (G,H)-minimal graphs. In this paper we prove that a tree T is not in ℜ(mK2,bPn) if it has a diameter of at least n(b+m−1)−1 for m,n,b≥2, furthermore we show that (b+m−1)Pn ∈ ℜ(mK2,bPn) for every m,n,b≥2. We also prove that for n≥3, a cycle on k vertices is in ℜ(mK2,bPn) if and only if k ∈ [n(b+m−2)+1, n(b+m−1)−1].
Bilangan Kromatik Lokasi Graf Helm Hm Dengan 3 ≤ m ≤ 9 Kelson Novrianus Lessya; Des Welyyanti; Lyra Yulianti
Jurnal Matematika UNAND Vol 12, No 3 (2023)
Publisher : Departemen Matematika dan Sains Data FMIPA Universitas Andalas Padang

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.25077/jmua.12.3.222-228.2023

Abstract

Misalkan G = (V, E) adalah graf terhubung dan c suatu k−pewarnaan dari G. Kelas warna pada G adalah himpunan titik-titik yang berwarna i, dinotasikan dengan Si untuk 1 ≤ i ≤ k. Misalkan Π = {S1, S2. · · · , Sk} merupakan partisi terurut dari V (G) kedalam kelas-kelas warna yang saling bebas. Berdasarkan pewarnaan titik, maka representasi titik v terhadap Π disebut kode warna dari v, dinotasikan dengan cΠ(v) dari suatu titik v ∈ V (G) didefinisikan sebagai k−pasang terurut, yaitu: cΠ(v) = (d(v, S1), d(v, S2), · · · , d(v, Sk)) dengan d(v, Si) = min{d(v, x)|x ∈ Si} untuk 1 ≤ i ≤ k. Jika setiap titik pada G memiliki kode warna yang berbeda terhadap Π, maka c disebut pewarnaan lokasi. Banyaknya warna minimum yang digunakan disebut bilangan kromatik lokasi, dinotasikan dengan χL(G). Pada tulisan ini akan dibahas bilangan kromatik lokasi graf helm Hm dengan 3 ≤ m ≤ 9.
Dimensi Metrik Dari Graf Palem mellany mellany; LYRA YULIANTI; DES WELYYANTI
Jurnal Matematika UNAND Vol 12, No 4 (2023)
Publisher : Departemen Matematika dan Sains Data FMIPA Universitas Andalas Padang

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.25077/jmua.12.4.276-282.2023

Abstract

Penelitian ini bertujuan mencari dimensi metrik dari garf palem CkPlSm, untuk k ≥ 3,l ≥ 2 dan m ≥ 2. Graf Palem CkPlSm merupakan graf yang dibangun oleh tiga graf, yaitu Graf Lingkaran Ck, Graf Lintasan Pl , dan Graf Bintang Sm. Penelitian ini diperoleh bahwa dimensi metrik graf palem adalah m, dim(H) = m.
The Classification of “Program Sembako” recipients in Payobasung West Sumatra based on the K-nearest neighbors classifier HAZMIRA YOZZA; NINDI MAULA AZIZAH; LYRA YULIANTI; IZZATI RAHMI
Jurnal Natural Volume 23 Number 2, June 2023
Publisher : Universitas Syiah Kuala

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.24815/jn.v23i2.29738

Abstract

The "Sembako Program" is a program carried out by the Indonesian government to improve the welfare of low-income communities. The purposes of this study are: (a) to determine the classification of households that deserve to receive basic-food assistance in Koto Panjang Payobasung, West Sumatra, using the KNN classifier and (b) to determine the optimal number of nearest neighbors used in the classification process. The measure of proximity between objects used is the Gower dissimilarity coefficient. This research used primary data consisting of 175 households collected purposively in a survey conducted on all households in Payobasung.  The optimal K value is determined by implementing a 5-fold cross-validation procedure. The result showed that the best classification process is when K = 3 nearest neighbors are used since it produces the highest accuracy coefficient and Mattews correlation coefficient (MCC). Therefore, for further work, in deciding the eligibility of a household to receive the Sembako Program in Payobasung, KNN can be used by considering its 3 nearest neighbors
The Bilangan Kromatik Lokasi Gabungan Graf Palem Nurinsani, Aisyah; Welyyanti, Des; Yulianti, Lyra
JMPM: Jurnal Matematika dan Pendidikan Matematika Vol 9 No 1 (2024): March - August 2024
Publisher : Prodi Pendidikan Matematika Universitas Pesantren Tinggi Darul Ulum Jombang

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.26594/jmpm.v9i1.4828

Abstract

Vertex coloring of a graph is the coloring of vertices such that two adjacent vertices have different colors. The color code of a vertex is the distance from the vertex to the partition of the existing color set. A graph has a locating coloring if each vertex has a different color code. A palm graph is a graph constructed from a cycle graph, path graph, and star graph. A disjoint union of palm graphs is a disconnected graph with palm graphs as its components. The locating chromatic number of graph is the minimum colors of the graph to have locating coloring with k colors. In this paper, we determine the locating chromatic number of a disjoint union of palm graph.
On locating-chromatic number of helm graph H_m FOR 10m28 WELYYANTI, DES; SUTANTO, DASA; YULIANTI, LYRA
Jurnal Natural Volume 24 Number 3, October 2024
Publisher : Universitas Syiah Kuala

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.24815/jn.v24i3.33190

Abstract

Let G = (V,E) be a connected graph and c be a k-coloring of G. The color class S_i of G is a set of vertices given color i, for 1 i k. Let = {S_1,S_2,,S_k} be an ordered partition of V(G). The color code of a vertex v $in$ (element) V(G) is defined as the ordered k--tuplec_ (v)=(d(v,S_1),d(v,S_2),...,d(v,S_k)),where d(v,S_i) = min{d(v,x)| x $in$ (element) S_i} for 1 i k. If distinct vertices have distinct color codes, then c is called a locating-coloring of G. The locating-chromatic number _L (G) is the minimum number of colors in a locating-coloring of G. This paper discusses the locating-chromatic number of helm graph H_m for 10 m 28. Helm graph H_m is constructed by adding some leaves to the corresponding vertices of wheels W_m, for m 3.
Dimensi Partisi Graf Thorn dari Graf Kincir ?Wd?_2^m untuk m=1,2,3 Zayendra, Siska -; Mardhaningsih, Auli; Yulianti, Lyra; Effendi, Effendi
JMPM: Jurnal Matematika dan Pendidikan Matematika Vol 4 No 1: March - August 2019
Publisher : Prodi Pendidikan Matematika Universitas Pesantren Tinggi Darul Ulum Jombang

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.26594/jmpm.v4i1.1434

Abstract

Misalkan G = (V, E)  adalah  suatu  graf terhubung.  Himpunan  titik  V(G) dipartisi  menjadi  beberapa  partisi,  dan  ? = {S1, S2, ..., Sk } sebagai  himpunan yang berisikan  k-partisi  tersebut.  Misalkan  v ? V (G),  representasi  v terhadap ? didefinisikan sebagai r(v|?)  = (d(v, S1), .., d(v, Sk )).  ? disebut  partisi  penye- lesaian jika setiap  titik  di G mempunyai  representasi  yang berbeda  terhadap ?. Kardinalitas yang minimum dari partisi  penyelesaian disebut  dimensi partisi  dari G, ditulis pd(G). Thorn  dari graf G, dengan parameter l1, l2, . . . , ln diperoleh dengan menambahkan daun sebanyak li ke titik vi  dari graf G, untuk  i ? {1, . . . , n}, dengan  li  ? 1.  Graf  thorn  dari  graf G dinotasikan  dengan  T h(G, l1, l2 , . . . , ln ). Pada  jurnal ini ditentukan dimensi partisi  graf thorn  dari graf kincir W d2m   untuk m = 1, 2, 3, dinotasikan  dengan T h(W d2m , l0 , l1, . . . , l2m ), untuk  i = 0, 1, 2, .., 2m.Kata kunci: Dimensi partisi,  graf thorn, graf kincir
MATRIKS TRANSFORMASI OPERATOR VECD* MENJADI VECH^ Alsbaldo, Yuco; Yanita, Yanita; Yulianti, Lyra
Jurnal Lebesgue : Jurnal Ilmiah Pendidikan Matematika, Matematika dan Statistika Vol. 6 No. 1 (2025): Jurnal Lebesgue : Jurnal Ilmiah Pendidikan Matematika, Matematika dan Statistik
Publisher : LPPM Universitas Bina Bangsa

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.46306/lb.v6i1.940

Abstract

This article discusses a new matrix operator that is constructed differently from the vech operator and the vecd operator by stacking the main diagonal entries (supra-diagonal) and entries of a square matrix. This operator, called  operator, explicitly constructs a matrix that transforms  into , where  is an  square matrix, and then obtains the properties of the transformation matrix
The Locating Chromatic Number of the Cyclic Chain Graph Abel, Latifa Azhar; Welyyanti, Des; Yulianti, Lyra; Permana, Dony
Science and Technology Indonesia Vol. 10 No. 3 (2025): July
Publisher : Research Center of Inorganic Materials and Coordination Complexes, FMIPA Universitas Sriwijaya

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.26554/sti.2025.10.3.958-962

Abstract

The locating chromatic number of graph G (χL(G)) combines the idea of the partition dimension and the chromatic number by considering the locations of the vertices of graph G. Let (Cni, m) be a cyclic chain graph, namely a group of blocks in the form of a cycle graph Cn1(1), Cn2(2), ···, Cni(i). The ni is the number of vertices on the i-th cycle, and m is the number of cycles, for ni ≥ 3, 1 ≤ i ≤ m, and m ≥ 2, and the vertex vi,⌈ni/2⌉+1 in Cni(i) is identified with the vertex vi,⌈ni/2⌉+1 in Cni+1(i+1). In this research, we determine χL(Cni, m) for ni ≥ 3, 1 ≤ i ≤ m, and m ≥ 2.
ON THE COMMUTATION MATRIX Yanita, Yanita; Yulianti, Lyra
BAREKENG: Jurnal Ilmu Matematika dan Terapan Vol 17 No 4 (2023): BAREKENG: Journal of Mathematics and Its Applications
Publisher : PATTIMURA UNIVERSITY

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.30598/barekengvol17iss4pp1997-2010

Abstract

The commutation matrix is a matrix that transforms any vec matrix , to vec transpose . In this article, three definitions of the commutation matrix are presented in different ways. It is shown that these three definitions are equivalent. Proof of the equivalent uses the properties in the Kronecker product on the matrix. We also gave the example of the commutation matrix using three ways as Moreover, in this study, we investigate the properties of the commutation matrix related to its transpose and the relation between the vec matrix and the vec transpose matrix using the commutation matrix. We have that the transpose and the inverse of the commutation matrix is its transpose.
Co-Authors A. Asmiati Abdi Musra Abel, Latifa Azhar ADE NGESTU SULISTIO ADEK HAYATI PUTRI Admi Nazra Aisyah Nurinsani Alifaziz Arsyad Alsbaldo, Yuco Angdini Putri F Angryanof, Uthary Putri Auli Mardhaningsih C. Ike Tri Widyastuti Daramenra, Romie DEBI ZULKARNAIN Des Welyyanti Effendi Effendi Effendi Effendi Eka Purwanti Elva Rahimah Fadillah Fadillah Fajri, Muhammad Rafif Fakhri Zikra Fawwaz Fakhrurrozi Hadiputra Fifi Febrianti Fitri - Anggalia Haves Derindo Hazmira Yozza Hidayati Rais Izzati Rahmi HG Kelson Novrianus Lessya Khairannisa Al Azizu KIKI KHAIRA MARDIMAR Laila Hidayati Lessya, Kelson Novrianus M Fauzan Hardi Maharani Damayanti Mardhaningsih, Auli Mardhaningsih, Auli Mardimar, Kiki Khaira Maya Nabila mellany mellany Mellany, Mellany Muhammad Rafif Fajri MUHAMMAD RANDA Muhardiansyah Muhardiansyah Mutiara Ramadhani Syafnur Nada Andriani Nadia Nadia Nadia Nadia Nailul Yuni Permataputri Narwen Narwen NINDI MAULA AZIZAH Nurhasanah Nurhasanah Nurinsani, Aisyah Permana, Dony Putri Wulan Sari Risya Hazani Utari RIZKI REFORMAN Robi Nugraha Sayi Romie Daramenra Shelli Fitrianda Siska - Zayendra Sri Hariyani Suci Yefri Fadillah Suciana Budi Aryani SUTANTO, DASA Syafrizal Sy Syafrizal Sy Syafrizal Sy . Syafwan, Mahdhivan Tika Apriliza ULFA RAHAYU SY Yanita Yanita YANITA YANITA, YANITA Zayendra, Siska - Zayendra, Siska - Zulakmal, Zulakmal ZULKARNAIN, DEBI