Article Per Year (5 Year)
p-Index From 2020 - 2025
1.642
P-Index
This Author published in this journals
All Journal CAUCHY: Jurnal Matematika Murni dan Aplikasi BAREKENG: Jurnal Ilmu Matematika dan Terapan JTAM (Jurnal Teori dan Aplikasi Matematika) Indonesian Journal of Combinatorics Al-Khwarizmi: Jurnal Pendidikan Matematika dan Ilmu Pengetahuan Alam Jurnal Matematika UNAND Jurnal Ilmiah Pendidikan Matematika Al Qalasadi JPMA JMT (Jurnal Matematika dan Terapan) Emerging Statistics and Data Science Journal
Ikhsanul Halikin, Ikhsanul
Graph, Combinatorics, And Algebra Research Group, Department Of Mathematics, FMIPA, Universitas Jember, Jl. Kalimantan 37 Jember 68121, Indonesia
Humanities Computer Science & IT Control & Systems Engineering Decision Sciences, Operations Research & Management Economics, Econometrics & Finance Education Energy Engineering Environmental Science Mathematics Mechanical Engineering Physics Transportation

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

Found 11 Documents
Search

 1   2 
Modified Chebyshev Collocation Method for Solving Differential Equations Arif, M Ziaul; Kamsyakawuni, Ahmad; Halikin, Ikhsanul
CAUCHY Vol 3, No 4 (2015): CAUCHY
Publisher : Mathematics Department, Maulana Malik Ibrahim State Islamic University of Malang

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (787.664 KB) | DOI: 10.18860/ca.v3i4.2923

Abstract

This paper presents derivation of alternative numerical scheme for solving differential equations, which is modified Chebyshev (Vieta-Lucas Polynomial) collocation differentiation matrices. The Scheme of modified Chebyshev (Vieta-Lucas Polynomial) collocation method is applied to both Ordinary Differential Equations (ODEs) and Partial Differential Equations (PDEs) cases. Finally, the performance of the proposed method is compared with finite difference method and the exact solution of the example. It is shown that modified Chebyshev collocation method more effective and accurate than FDM for some example given.
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.
Pelabelan Lokal Titik Graf Hasil Diagram Lattice Subgrup Zn Ikhsanul Halikin
Al-Khwarizmi : Jurnal Pendidikan Matematika dan Ilmu Pengetahuan Alam Vol 6, No 1 (2018): Al-Khwarizmi: Jurnal Pendidikan Matematika dan Ilmu Pengetahuan Alam
Publisher : Prodi Pendidikan Matematika FTIK IAIN Palopo

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (552.029 KB) | DOI: 10.24256/jpmipa.v6i1.409

Abstract

AbstractA group is a system that contains a set and a binary operation satisfying four axioms, i.e., the set is closed under binary operation, associative, has an identity element, and each element has an inverse. Since the group is essentially a set and the set itself has subsets, so if the binary operation is applied to its subsets then it satisfies the group's four axioms, the subsets with the binary operation are called subgroups. The group and subgroups further form a partial ordering relation. Partial ordering relation is a relation that has reflexive, antisymmetric, and transitive properties. Since the connection of subgroups of a group is partial ordering relation, it can be drawn a lattice diagram. The set of integers modulo n, , is a group under addition modulo n. If the subgroups of are represented as vertex and relations that is connecting two subgroups are represented as edgean , then a graph is obtained. Furthermore, the vertex in this graph can be labeled by their subgroup elements. In this research, we get the result about the characteristic of the lattice diagram of and the existence of vertex local labeling.AbstrakGrup merupakan sistem yang memuat sebuah himpunan dan operasi biner yang memenuhi 4 aksioma, yaitu operasi pada himpunannya bersifat tertutup, assosiatif, memiliki elemen identitas, dan setiap elemennya memiliki invers. Grup pada dasarnya adalah himpunan dan himpunan itu memiliki himpunan bagian. Jika operasi tersebut diberlakukan pada himpunan bagiannya dan memenuhi 4 aksioma grup maka himpunan bagian dan operasi tersebut disebut subgrup. Grup dan subgrup ini selanjutnya membentuk suatu relasi pengurutan parsial. Relasi pengurutan parsial adalah suatu relasi yang memiliki sifat refleksif, antisimetris, dan transitif. Oleh karenanya, relasi subgrup-subgrup dari suatu grup ini dapat digambar diagram latticenya. Himpunan bilangan bulat modulo n, , merupakan grup terhadap operasi penjumlahan modulo n. Jika subgrup pada direpresentasikan sebagai titik dan relasi yang menghubungkan dua buah subgrupnya direpresentasikan sebagai sisi, maka diperoleh suatu graf. Titik-titik pada graf ini dapat dilabeli berdasarkan elemen-elemen subgrupnya. Pada penelitian ini diperoleh hasil kajian mengenai karakteristik diagram lattice subgrup dan eksistensi pelabelan lokal titiknya.
PENINGKATAN KOMPETENSI GURU MGMP MATEMATIKA SMP WILAYAH KABUPATEN JEMBER TIMUR DALAM PEMANFAATAN PEMBELAJARAN BERBASIS WEB INTERAKTIF PADA POKOK BAHASAN HIMPUNAN, RELASI, DAN FUNGSI Ikhsanul Halikin; I Made Tirta; Kusbudiono Kusbudiono
Jurnal Pengabdian Masyarakat Applied Vol 1 No 2 (2022): JPMA Volume 1 Number 2 Year 2022
Publisher : Fakultas Ekonomi dan Bisnis

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (585.039 KB) | DOI: 10.19184/jpma.v1i2.34765

Abstract

Munculnya COVID 19 yang berkepenjangan menyebabkan pembelajaran di semua tingkat, termasuk pembelajaran di SMA, dilakukan secara daring. Dalam pembelajaran secara daring sangat dirasakan perlunya media pembelajaran yang memungkinkan siswa belajar secara aktif. Salah satu yang termasuk media pembelajaran jenis ini adalah media pembelajaran online yang bersifat dinamik dan interaktif. Jurusan Matematika FMIPA Universitas Jember telah mengembangkan media pembelajaran melalui web interaktif (https://statslab-rshiny.fmipa.unej.ac.id/RDoc/Himpunan/) yang dapat diakses oleh siswa kapan pun dan dimana pun, sebagai salah satu upaya untuk membuat pembelajaran daring lebih optimal. Dalam pengabdian ini dilakukan kegiatan pemaparan dan pelatihan kepada guru MGMP Matematika SMP Wilayah Kabupaten Jember Timur mengenai penerapan web dalam proses pembelajaran yang interaktif terutama untuk pokok bahasan himpunan, relasi, dan fungsi. Kegiatan tersebut dilakukan dua tahap, yaitu kegiatan secara offline di SMP Negeri 1 Mumbulsari dilanjutkan dengan komunikasi secara online selama latihan memanfaatkan web. Hasil pengamatan selama berlangsungnya proses kegiatan dan umpan balik terhadap kegiatan ini menunjukkan adanya antusiasme dan respon yang sangat baik dari para guru.
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.
Penerapan Algoritma Dijkstra dalam Pencarian Rute Terpendek Wisata Religi Kiswara Agung Santoso; Zakiyatul Afifah; Ikhsanul Halikin
Jurnal Ilmiah Pendidikan Matematika Al Qalasadi Vol 7 No 2 (2023): JURNAL ILMIAH PENDIDIKAN MATEMATIKA AL QALASADI
Publisher : Prodi Pendidikan Matematika, Fakultas Tarbiyah dan Ilmu Keguruan IAIN Langsa

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.32505/qalasadi.v7i2.6227

Abstract

Pilgrimages to the graves of Waliyullah and the spreaders of Islam have become spiritual or religious tourism for Muslims in Java and even almost all Muslims in Indonesia. This opens up opportunities for travel agents to help pilgrims on religious tourism trips. One travel agency that offers religious tour packages is PT Mitra Jaya Group which operates in the Banyuwangi area, East Java. Many travel agencies are trying to increase their competitiveness, to survive competition between travel agencies, especially in improving services and financial management. One way that can be done is to determine the shortest route for religious tourism so that the distance traveled is minimal, where previously the route chosen was not based on proper research. In this paper, the search for the shortest route is carried out by applying the Dijkstra algorithm. The application of the Dijkstra algorithm can provide benefits regarding the shortest distance to religious tourism routes from PT Mitra Jaya Group. From the analysis results, the total shortest distance obtained was 2768.8 kilometers. The resulting shortest route distance is smaller than the distance before using the Dijkstra algorithm, namely 3005.6 kilometers. The difference is 236.8 kilometers and there is a distance saving of 7.87
Penerapan Model Ekonomi Leontief Menggunakan Metode Dekomposisi Lower Upper pada Penentuan Nilai Produksi Industri Unggulan Jawa: Penerapan Model Ekonomi Leontief Kusbudiono, Kusbudiono; Mustafa , Meiunike Indah; Halikin, Ikhsanul
Emerging Statistics and Data Science Journal Vol. 1 No. 3 (2023): Emerging Statistics and Data Science Journal
Publisher : Statistics Department, Universitas Islam Indonesia

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.20885/esds.vol1.iss.3.art37

Abstract

Ekonomi adalah aturan tentang tindakan untuk memenuhi kebutuhan hidup melalui konsumsi, produksi, dan distribusi. Kegiatan ini sangat erat kaitannya dengan kependudukan. Pertumbuhan penduduk yang cepat menyebabkan sumber daya yang terbatas. Oleh karena itu, keseimbangan antara sumber daya dan kegiatan ekonomi sangat diperlukan. Salah satu upayanya adalah setiap produsen yang merupakan salah satu pelaku ekonomi perlu mengetahui nilai produksinya agar semua kebutuhan terpenuhi. Nilai produksi dapat ditentukan dengan menggunakan model ekonomi Leontief dan dekomposisi atas bawah. Berdasarkan latar belakang tersebut penulis menentukan nilai produksi industri unggulan Jawa Timur dengan menggunakan model ekonomi Leontief dan lower upper decomposition. Metode yang digunakan dalam penelitian adalah studi literatur, dan data input-output produk unggulan propinsi Jawa Timur tahun 2021 yang digunakan diperoleh dari Badan Pusat Statistik [3]. Berdasarkan studi literatur mengenai model ekonomi Leontief didapatkan langkah-langkah untuk menyelesaikan model menggunakan low upper dekomposisi. Hasil dari penelitian ini adalah nilai produksi dari sembilan industri unggulan yaitu, Industri ketenagalistrikan sebesar Rp59.281.599,00, industri kimia, farmasi, dan obat sebesar Rp135.398.978,00, industri makanan dan minuman sebesar Rp336.948.795,00, industri tekstil dan pakaian jadi sebesar Rp32.642.590,00, industri jasa informasi dan komunikasi sebesar Rp100.423.238,00, industri jasa perusahaan Rp35.404.398,00, industri kulit dan barang dari kulit sebesar Rp16.610.424,00, industri          perdagangan besar         dan eceran sebesar Rp224.936.840,00, dan industri angkutan rel sebesar Rp1.502.281,00.
THE HARMONIOUS, ODD HARMONIOUS, AND EVEN HARMONIOUS LABELING Lasim, Ahmad; Halikin, Ikhsanul; Wijaya, Kristiana
BAREKENG: Jurnal Ilmu Matematika dan Terapan Vol 16 No 4 (2022): BAREKENG: Journal of Mathematics and Its Applications
Publisher : PATTIMURA UNIVERSITY

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (396.742 KB) | DOI: 10.30598/barekengvol16iss4pp1131-1138

Abstract

Suppose is a simple and connected graph with edges. A harmonious labeling on a graph is an injective function so that there exists a bijective function where for each An odd harmonious labeling on a graph is an injective function from to non-negative integer set less than so that there is a function where for every An even harmonious labeling on a graph is an injective function so that there is a bijective function where for each . In this paper, we discuss how to build new labeling (harmonious, odd harmonious, even harmonious) based on the existing labeling (harmonious, odd harmonious, even harmonious)
An Inclusive Distance Irregularity Strength of n-ary Tree Wijaya, Kristiana; Aulia, Safira Nur; Halikin, Ikhsanul; Kusbudiono, Kusbudiono
JTAM (Jurnal Teori dan Aplikasi Matematika) Vol 8, No 2 (2024): April
Publisher : Universitas Muhammadiyah Mataram

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.31764/jtam.v8i2.20549

Abstract

An inclusive distance vertex irregular labelling of a simple graph G is a function of the vertex set of  to positive integer set such that the sum of its vertex label and the labels of all vertices adjacent to the vertex are distinct. The minimum of maximum label of the vertices is said to be inclusive distance irregularity strength of G, denoted by dis(G). The purpose of this research is showing that dis(T_{n,2})= (n^2+2)/2 where T_{n,2} is a complete n-ary tree to level two.
(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 Afifah, Zakiyatul Ahmad Kamsyakawuni Aulia, Safira Nur I Made Tirta Kiswara Agung Santoso Kristiana Wijaya Kusbudiono Kusbudiono Kusbudiono, Kusbudiono Kusbudiono, Kusbudono Lasim, Ahmad M Ziaul Arif, M Ziaul Mustafa , Meiunike Indah Sabrina Shena Sarasvati Sulistyanto, Andry Vira Ulyatul Maghfiroh Zakiyatul Afifah