Article Per Year (5 Year)
p-Index From 2020 - 2025
0.444
P-Index
This Author published in this journals
All Journal JURNAL MATEMATIKA STATISTIKA DAN KOMPUTASI
Junianto Sesa
Universitas Papua
Mathematics

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

Found 2 Documents
Search

 1 
Determination of Fractional Chromatic Numbers in the Operation of Adding Two Different Graphs: Penentuan Bilangan Kromatik Fraksional pada Operasi Penjumlahan Dua Graf berbeda Junianto Sesa; Siswanto Siswanto
Jurnal Matematika, Statistika dan Komputasi Vol. 18 No. 2 (2022): JANUARY 2022
Publisher : Department of Mathematics, Hasanuddin University

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.20956/j.v18i2.14501

Abstract

The development of graph theory has provided many new pieces of knowledge, one of them is graph color. Where the application is spread in various fields such as the coding index theory. Fractional coloring is multiple coloring at points with different colors where the adjoining point has a different color. The operation in the graph is known as the sum operation. Point coloring can be applied to graphs where the result of operations is from several special graphs. In this case, the graph summation results of the path graph and the cycle graph will produce the same fractional chromatic number as the sum of the fractional chromatic numbers of each graph before it is operated.
Nilai Total Ketidakteraturan Titik Pada Amalgamasi Graf Prisma Junianto Sesa; La Ode Muhlis
Jurnal Matematika, Statistika dan Komputasi Vol. 19 No. 3 (2023): MAY, 2023
Publisher : Department of Mathematics, Hasanuddin University

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.20956/j.v19i3.23571

Abstract

It is not possible to determine the total vertex of irregular strength of all graphs. This study aims to ascertain the total vertex irregularity strength in prismatic graph amalgamation for n>=4. Determination of the total vertex irregularity strength in prismatic graph amalgamation is done by ascertaining the largest lower limit and the smallest upper limit. The lower limit is analyzed based on the graph properties and other supporting theorems, while the upper limit is analyzed by labeling the vertices and edges of the prismatic amalgamation graph. Based on the results of this study, the total vertex irregularity strength in prismatic graph amalgamation is obtained, namely (4(P2,n))=2n , for n>=4.
Co-Authors La Ode Muhlis Siswanto Siswanto