Article Per Year (5 Year)
p-Index From 2021 - 2026
1.376
P-Index
This Author published in this journals
All Journal Electronic Journal of Graph Theory and Applications (EJGTA) BAREKENG: Jurnal Ilmu Matematika dan Terapan JTAM (Jurnal Teori dan Aplikasi Matematika) Indonesian Journal of Combinatorics Jurnal Matematika UNAND Majalah Ilmiah Matematika dan Statistika (MIMS) JMT (Jurnal Matematika dan Terapan)
Kristiana Wijaya
Universitas Jember Indonesia
Computer Science & IT Control & Systems Engineering Decision Sciences, Operations Research & Management Economics, Econometrics & Finance Electrical & Electronics Engineering Energy Engineering Mathematics Mechanical Engineering Physics Transportation

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

Found 2 Documents
Search
Journal : Jurnal Matematika UNAND

 1 
DIMENSI METRIK DARI GRAF HASIL IDENTIFIKASI Kristiana Wijaya
Jurnal Matematika UNAND Vol 11, No 3 (2022)
Publisher : Jurusan Matematika FMIPA Universitas Andalas Padang

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

Abstract

Pada paper ini dibahas mengenai dimensi metrik dari graf hasil identififikasi. Dimensi metrik dari sebuah graf G, dinotasikan dengan dim(G), adalah kardinalitas paling kecil dari setiap himpunan pembeda di G. Poisson dan Zhang telah memberikan batas bawah dan atas dimensi metrik dari graf hasil identifikasi. Pada paper ini dibahas dimensi metrik dari graf reguler yang diidentifikasi dengan graf lintasan. Selain itu, diberikan juga kelas-kels graf yang hasil identifikasinya mempunyai dimensi metrik tepat sama dengan batas bawah yang dihasilkan oleh Poisson dan Zhang.
(STRONG) RAINBOW CONNECTION NUMBERS ON CORONA PRODUCT OF PATH AND COMPLETE GRAPHS Sulistyanto, Andry; Halikin, Ikhsanul; Kusbudiono, Kusbudono; Wijaya, Kristiana
Jurnal Matematika UNAND Vol. 14 No. 4 (2025)
Publisher : Departemen Matematika dan Sains Data FMIPA Universitas Andalas Padang

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

Abstract

Let G be an edge-colored, where adjacent edges may have the same color. A u-v path in G is a rainbow u-v path if no two edges of u-v path are colored the same. The graph G is called rainbow-connected if G contains a rainbow u-v path for every two vertices u and v of G. A rainbow connection number of rainbow-connected G is the minimum color in G. A rainbow u-v path is called a rainbow u-v geodesic if a rainbow u-v path of length distance from a vertex u to v. A graph G is strongly rainbow-connected if G contains a rainbow u-v geodesic for every two vertices u and v of G. The minimum color of the edges of G such that G is strongly rainbow-connected is the strong rainbow connection number. In this paper, we disccus (strong) rainbow connection number of corona product of path and complete graph. 
Co-Authors Aulia, Safira Nur Djoko Suprijanto Edy Tri Baskoro Faisal Susanto Hilda Assiyatun I Wayan Sudarsana Ikhsanul Halikin, Ikhsanul Kiswara Agung Santoso Kusbudiono Kusbudiono Kusbudiono, Kusbudiono Kusbudiono, Kusbudono Lasim, Ahmad Maulana, Nur Ridwan S Slamin Sabrina Shena Sarasvati Sulistyanto, Andry Vira Ulyatul Maghfiroh