Article Per Year (5 Year)
p-Index From 2019 - 2024
0.817
P-Index
This Author published in this journals
All Journal Electronic Journal of Graph Theory and Applications (EJGTA) 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 Decision Sciences, Operations Research & Management Economics, Econometrics & Finance Electrical & Electronics Engineering Mathematics

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

Found 6 Documents
Search

 1 
POLINOMIAL KROMATIK PADA GRAF KIPAS Maulana, Nur Ridwan; Wijaya, Kristiana; Santoso, Kiswara Agung
Majalah Ilmiah Matematika dan Statistika Vol 18 No 2 (2018): Majalah Ilmiah Matematika dan Statistika
Publisher : Jurusan Matematika FMIPA Universitas Jember

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.19184/mims.v18i2.17248

Abstract

A chromatic polynomial of a graph G is a special function that describes the number of ways we can achieve a proper coloring on the vertices of G given k colors. In this paper, we determine a chromatic polynomial of a fan graph. Keywords: Proper coloring, chromatic polynomial, fan graph.
The complete list of Ramsey $(2K_2,K_4)$-minimal graphs Kristiana Wijaya; Edy Tri Baskoro; Hilda Assiyatun; Djoko Suprijanto
Electronic Journal of Graph Theory and Applications (EJGTA) Vol 3, No 2 (2015): 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.2015.3.2.9

Abstract

Let $F, G,$ and $H$ be non-empty graphs. The notation $F \rightarrow (G,H)$ means that if all edges of $F$ are arbitrarily colored by red or blue, then either the subgraph of $F$ induced by all red edges contains a graph $G$ or the subgraph of $F$ induced by all blue edges contains a graph $H.$ A graph $F$ satisfying two conditions: $F \rightarrow (G,H)$ and $(F-e) \nrightarrow (G,H)$ for every $e \in E(F)$ is called a Ramsey $(G,H)-$minimal graph. In this paper, we determine all non-isomorphic Ramsey $(2K_2,K_4)$-minimal graphs.
Non-inclusive and inclusive distance irregularity strength for the join product of graphs Faisal Susanto; Kristiana Wijaya; I Wayan Sudarsana; Slamin Slamin
Electronic Journal of Graph Theory and Applications (EJGTA) Vol 10, No 1 (2022): 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.2022.10.1.1

Abstract

A function ϕ: V(G)→{1, 2, …, k} of a simple graph G is said to be a non-inclusive distance vertex irregular k-labeling of G if the sums of labels of vertices in the open neighborhood of every vertex are distinct and is said to be an inclusive distance vertex irregular k-labeling of G if the sums of labels of vertices in the closed neighborhood of each vertex are different. The minimum k for which G has a non-inclusive (resp. an inclusive) distance vertex irregular k-labeling is called a non-inclusive (resp. an inclusive) distance irregularity strength and is denoted by dis(G) (resp. by dis(G)). In this paper, the non-inclusive and inclusive distance irregularity strength for the join product graphs are investigated.
Odd Harmonious Labeling of Pn ⊵ C4 and Pn ⊵ D2(C4) Sabrina Shena Sarasvati; Ikhsanul Halikin; Kristiana Wijaya
Indonesian Journal of Combinatorics Vol 5, No 2 (2021)
Publisher : Indonesian Combinatorial Society (InaCombS)

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

Abstract

A graph G with q edges is said to be odd harmonious if there exists an injection f:V(G) → ℤ2q so that the induced function f*:E(G)→ {1,3,...,2q-1} defined by f*(uv)=f(u)+f(v) is a bijection.Here we show that graphs constructed by edge comb product of path Pn and cycle on four vertices C4 or shadow of cycle of order four D2(C4) are odd harmonious.
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.
Implementasi Pencarian Rute Terpendek Tour Wisata di Banyuwangi pada Agen Travel Menggunakan Algoritma Floyd Warshall Kusbudiono; Vira Ulyatul Maghfiroh; Ikhsanul Halikin; Kristiana Wijaya
JMT : Jurnal Matematika dan Terapan Vol 5 No 2 (2023): JMT (Jurnal Matematika dan Terapan)
Publisher : Program Studi Matematika Universitas Negeri Jakarta

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.21009/jmt.5.2.1

Abstract

Tourism is travel aim to visit tourist attractions. Holidays to tourist attractions can eliminate boredom, improve the brain's work system, and foster a feeling of happiness. Holidays to tourist attractions can be assisted by travel agents. This research was carried out by looking for the shortest route from tour packages the travel agent in Banyuwangi. Search for the shortest route is aim to save time on travel package rundown tour, the distance traveled, and the fuel used. Search for the shortest route can be calculated using Floyd Warshall Algorithm. This algorithm was chosen because it can evaluate each pair vertex at each iteration to find the shortest distance. Search for the shortest distance is checking each pair vertex and choosing the smallest distance between the actual distance and the initial distance plus the final distance. The results of this research are found in the last iteration of each tour package. The total distance of the tour package is calculated using the Floyd Warshall Algorithm to get smaller distance than the total distance of the tour package with the route taken normally. Tour package distance using Floyd Warshall Algorithm experienced distance savings seen from the difference between the two.
Co-Authors Djoko Suprijanto Edy Tri Baskoro Faisal Susanto Hilda Assiyatun I Wayan Sudarsana Ikhsanul Halikin, Ikhsanul Kiswara Agung Santoso Kusbudiono Maulana, Nur Ridwan S Slamin Sabrina Shena Sarasvati Vira Ulyatul Maghfiroh