Open AccessDetermination of Fractional Chromatic Numbers in the Operation of Adding Two Different Graphs
Author(s) -
Junianto Sesa,
Siswanto Siswanto
Publication year - 2022
Publication title -
jurnal matematika, statistika dan komputasi/jurnal matematika statistik dan komputasi
Language(s) - English
Resource type - Journals
eISSN - 2614-8811
pISSN - 1858-1382
DOI - 10.20956/j.v18i2.14501
Subject(s) - fractional coloring , graph coloring , windmill graph , mathematics , combinatorics , edge coloring , critical graph , butterfly graph , discrete mathematics , list coloring , chromatic scale , complete coloring , graph , voltage graph , line graph , graph power
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.