Claim Missing Document
Check
Articles

Found 2 Documents
Search
Journal : Journal of Mathematics Education and Science

Graph Coloring on the Primary Dryland Forest Cover Map of Kalimantan Using the Greedy Algorithm Izzaty Farha; Putri Pita Mutia; Rachel Cornelia Simanjuntak; Desi Febriani Putri; Fidia Deny Tisna Amijaya
Journal of Mathematics Education and Science Vol. 8 No. 2 (2025): Journal of Mathematics Education and Science
Publisher : Universitas Nahdlatul Ulama Sunan Giri Bojonegoro

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.32665/james.v8i2.4628

Abstract

In graph theory, graph coloring is a popular approach, including in map creation, and this study aims to apply the Greedy algorithm to color forest land-cover maps while ensuring that adjacent areas do not share the same color. The data used consist of land-cover classification maps and the relationships between regions represented as planar graphs. The Greedy algorithm is implemented by arranging nodes based on their highest degrees and then coloring them sequentially. The coloring results show that the algorithm can provide an efficient solution with a minimum number of colors according to the upper bound of graph coloring, particularly for primary dry forest land-cover maps in East Kalimantan Province, achieving a chromatic number χ(G) = 4, ensuring no neighboring areas share the same color. Although it does not always yield an optimal solution, the algorithm proves effective, simple, and applicable to various other uses such as spatial analysis, regional clustering, or geographic information systems. The novelty of this study lies in its application to primary dry forests in Kalimantan, which have been rarely explored, and its contribution to spatial analysis and conservation efforts.
On Local Vertex Antimagic Total Coloring Of Path, Cycle, And Star Graphs With Comb Operation Taradita Ayitia Meisya Fendina; Desi Febriani Putri; Wasono; Maria Alensia Deltin Dala
Journal of Mathematics Education and Science Vol. 8 No. 2 (2025): Journal of Mathematics Education and Science
Publisher : Universitas Nahdlatul Ulama Sunan Giri Bojonegoro

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.32665/james.v8i2.4777

Abstract

Let G(V,E) be a graph consisting of a set of vertices V(G) and a set of edges E(G) where the number of vertices and edges are denoted by |V(G)| and |E(G)|, respectively. A bijective function f:V(G) \vee E(G) \to {1,2,3,...,(|V(G)|+|E(G)|)} is defined as a local vertex antimagic total coloring if there exist two adjacent vertex vx and vy with . Therefore, every local vertex antimagic total coloring produces a vertex coloring of the graph G, where each vertex v is assigned a color corresponding to its weight w(v). This research is essential as it contributes to development of graph coloring theory, particularly in the area of local vertex antimagic total coloring, which has been rarely studied. This research discusses the local vertex antimagic total coloring of and  which aims to determine the chromatic number. The result of the research is the chromatic number of local vertex antimagic total coloring of  and the chromatic number of local vertex antimagic total coloring , is if  is odd and  if  is even.