Claim Missing Document
Check
Articles

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.
ON THE LOCATING CHROMATIC NUMBER OF DISJOINT UNION OF BUCKMINSTERFULLERENE GRAPHS Zulkarnain, Debi; Yulianti, Lyra; Welyyanti, Des; Mardimar, Kiki Khaira; Fajri, Muhammad Rafif
BAREKENG: Jurnal Ilmu Matematika dan Terapan Vol 18 No 2 (2024): BAREKENG: Journal of Mathematics and Its Application
Publisher : PATTIMURA UNIVERSITY

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.30598/barekengvol18iss2pp0915-0922

Abstract

Let be a connected non-trivial graph. Let c be a proper vertex-coloring using k colors, namely . Let be a partition of induced by , where is the color class that receives the color . The color code, denoted by , is defined as , where for , and is the distance between two vertices and in G. If all vertices in have different color codes, then is called as the locating-chromatic -coloring of . The locating-chromatic number of , denoted by , is the minimum such that has a locating coloring. Let be the Buckminsterfullerene graph on vertices. Buckminsterfullerene graph is a 3-connected planar graph and a member of the fullerene graphs, representing fullerene molecules in chemistry. In this paper, we determine the locating chromatic number of the disjoint union of Buckminsterfullerene graphs, denoted by .
THE LOCATING CHROMATIC NUMBER OF CHAIN(A,4,n) GRAPH Welyyanti, Des; Abel, Latifa Azhar; Yulianti, Lyra
BAREKENG: Jurnal Ilmu Matematika dan Terapan Vol 19 No 1 (2025): BAREKENG: Journal of Mathematics and Its Application
Publisher : PATTIMURA UNIVERSITY

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.30598/barekengvol19iss1pp353-360

Abstract

Let be a connected graph with a vertex coloringsuch that two adjacent vertices have different colors. We denote an ordered partition where is a color class with color-, consisting of vertices given color , for . The color code of a vertex in is a -vector: . where is the distance between a vertex in and for . If every two vertices and in have different color codes, , then is called the locating -coloring of . The minimum number of colors k needed in this coloring is defined as the locating chromatic number, denoted by . This paper determines the locating chromatic number of chain graph and the induction of two graphs . Graph is a cyclic graph , which is the identification of , for n>2.
The locating chromatic number of (k,n)-split cycle graph and its barbell operation Asmiati, Asmiati; Prawinasti, Kasandra; Damayanti, Maharani; Yulianti, Lyra
Electronic Journal of Graph Theory and Applications (EJGTA) Vol 13, No 2 (2025): Electronic Journal of Graph Theory and Applications
Publisher : GTA Research Group, Univ. Newcastle, Indonesian Combinatorics Society and ITB

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.5614/ejgta.2025.13.2.3

Abstract

The locating chromatic number remains an active topic in graph theory. It combines the concepts of partition dimension and proper vertex coloring. A necessary condition for determining the locating chromatic number is that each vertex must have a unique color code under a minimal coloring. This paper investigates the locating chromatic number of the (k,n)-split cycle graph and its barbell operation.
On the metric dimension of Buckminsterfullerene-net graph Yulianti, Lyra; Welyyanti, Des; Yanita, Yanita; Fajri, Muhammad Rafif; Saputro, Suhadi Wido
Indonesian Journal of Combinatorics Vol 7, No 2 (2023)
Publisher : Indonesian Combinatorial Society (InaCombS)

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

Abstract

The metric dimension of an arbitrary connected graph G, denoted by dim(G), is the minimum cardinality of the resolving set W of G. An ordered set W = {w1, w2,..., wk} is a resolving set of G if for all two different vertices in G, their metric representations are different with respect to W. The metric representation of a vertex v with respect to W is defined as k-tuple r(v|W) = (d(v,w1), d(v,w2),..., d(v,wk)), where d(v,wj) is the distance between v and wj for 1 ≤ j ≤ k. The Buckminsterfullerene graph is a 3-reguler graph on 60 vertices containing some cycles C5 and C6. Let B60t denotes the tth  B60 for 1 ≤ t ≤ m and m ≥ 2. Let vt be a terminal vertex for each B60t. The Buckminsterfullerene-net, denoted by H:=Amal{B60t,v| 1 ≤ t ≤ m; m ≥ 2} is a graph constructed from the identification of all terminal vertices vt, for 1 ≤ t ≤ m and m ≥ 2, into a new vertex, denoted by v. This paper will determine the metric dimension of the Buckminsterfullerene-net graph H.
Dimensi Metrik Dari Graf Palem mellany, mellany; YULIANTI, LYRA; WELYYANTI, DES
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.
Bilangan Kromatik Lokasi Graf Helm Hm Dengan 3 ≤ m ≤ 9 Lessya, Kelson Novrianus; Welyyanti, Des; Yulianti, Lyra
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.
Bilangan Kromatik Lokasi Pada Graf Amalgamasi Kipas Berekor Des Welyyanti; Nada Andriani; Lyra Yulianti
Limits: Journal of Mathematics and Its Applications Vol. 20 No. 1 (2023): Limits: Journal of Mathematics and Its Applications Volume 20 Nomor 1 Edisi Ma
Publisher : Pusat Publikasi Ilmiah LPPM Institut Teknologi Sepuluh Nopember

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

Abstract

Misalkan G adalah graf terhubung dengan himpunan simpul V dan himpunan sisi E, serta c adalah suatu k-pewarnaan dari G. Misalkan P adalah partisi terurut dari V(G) ke dalam kelas warna yang dihasilkan, yaitu P = {S1, S2, ..., Sk}. Berdasarkan pewarnaan simpul, maka representasi simpul v terhadap partisi P disebut kode warna dari v, dan dinotasikan dengan c_P(v). Kode warna c_P(v) dari suatu simpul v yang termasuk dalam V(G) didefinisikan sebagai pasangan terurut sebanyak k buah.
Dimensi Metrik Graf Buckminsterfullerene-Subdivisi dan Buckminsterfullerene-Star Lyra Yulianti; Laila Hidayati; Des Welyyanti
Limits: Journal of Mathematics and Its Applications Vol. 20 No. 2 (2023): Limits: Journal of Mathematics and Its Applications Volume 20 Nomor 2 Edisi Ju
Publisher : Pusat Publikasi Ilmiah LPPM Institut Teknologi Sepuluh Nopember

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

Abstract

Misalkan terdapat graf Buckminsterfullerene dengan 60 titik. Graf Buckminsterfullerene-subdivisi , dinotasikan , , dikonstruksi dengan cara melakukan operasi subdivisi terhadap satu sisi tertentu di , yaitu penyisipan sebanyak titik di sisi tersebut. Selanjutnya, Graf Buckminsterfullerene-star , dinotasikan , dikonstruksi dengan cara mengidentifikasi masing-masing satu titik daun dari lima graf bintang dengan titik yang bersesuaian di Pada artikel ini akan ditentukan dimensi metrik dari dan untuk .
Dimensi Metrik Amalgamasi Graf Theta Des Welyyanti; Alifaziz Arsyad; Lyra Yulianti
Limits: Journal of Mathematics and Its Applications Vol. 20 No. 2 (2023): Limits: Journal of Mathematics and Its Applications Volume 20 Nomor 2 Edisi Ju
Publisher : Pusat Publikasi Ilmiah LPPM Institut Teknologi Sepuluh Nopember

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

Abstract

Misalkan G = (V, E) adalah suatu graf terhubung dengan himpunan titik V(G) dan himpunan sisi E(G). Misalkan u dan v adalah titik-titik dalam graf terhubung G, panjang lintasan terpendek dari u ke v pada G dinotasikan d(u, v). Jika S adalah suatu himpunan terurut dari titik-titik dalam graf terhubung G dan titik V E V(G), maka representasi dari titik v terhadap S, dinotasikan r(v | S), adalah vektor d(v, s1), d(v, s2), ..., d(v, sk) untuk setiap si E S. Jika r(v | S) untuk setiap titik V E V(G) berbeda, maka S dinamakan himpunan pembeda dari G. Himpunan pembeda dengan kardinalitas minimum dinamakan himpunan pembeda minimum, dan kardinalitas dari himpunan pembeda minimum dinamakan dimensi metrik (metric dimension) dari G, dinotasikan dim(G). Pada penelitian ini dibahas tentang dimensi metrik amalgamasi graf Theta.
Co-Authors A. Asmiati Abdi Musra Abel, Latifa Azhar ADE NGESTU SULISTIO ADEK HAYATI PUTRI Admi Nazra Aisyah Nurinsani Aisyah Nurinsani Alifaziz Arsyad Alifaziz Arsyad Alsbaldo, Yuco Angdini Putri F Angryanof, Uthary Putri Asmiati, Asmiati Auli Mardhaningsih C. Ike Tri Widyastuti Damayanti, Maharani Daramenra, Romie DEBI ZULKARNAIN Des Welyyanti Dony Permana Effendi Effendi Effendi Effendi Eka Purwanti Elva Rahimah Fadillah Fadillah Fajri, Muhammad Rafif Fajri, Muhammad Rafif Fakhri Zikra Fawwaz Fakhrurrozi Hadiputra Fifi Febrianti Fitri - Anggalia Haves Derindo Hazmira Yozza Hidayati Rais Izzati Rahmi H.G Izzati Rahmi HG Kelson Novrianus Lessya Khairannisa Al Azizu KIKI KHAIRA MARDIMAR Laila Hidayati Laila Hidayati Latifa Azhar Abel Lessya, Kelson Novrianus M Fauzan Hardi Maharani Damayanti Mardhaningsih, Auli Mardhaningsih, Auli Mardimar, Kiki Khaira mellany mellany Mellany, Mellany Muhammad Rafif Fajri Muhammad Rafif Fajri MUHAMMAD RANDA Muhardiansyah Muhardiansyah Muhardiansyah, Muhardiansyah Mutiara Ramadhani Syafnur Nabila, Maya Nada Andriani Nada Andriani Nadia Nadia Nadia Nadia Nailul Yuni Permataputri Narwen Narwen NINDI MAULA AZIZAH Nurhasanah Nurhasanah Nurinsani, Aisyah Permana, Dony Prawinasti, Kasandra Putri Wulan Sari Risya Hazani Utari RIZKI REFORMAN Robi Nugraha Sayi Romie Daramenra Saputro, Suhadi Wido 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 Uthary Putri Angryanof Yanita Yanita YANITA YANITA, YANITA Zayendra, Siska - Zayendra, Siska - Zulakmal, Zulakmal ZULKARNAIN, DEBI