Results 1 to 10 of about 84,087 (307)
Oriented Coloring on Recursively Defined Digraphs
Algorithms, 2019 Coloring is one of the most famous problems in graph theory. The coloring problem on undirected graphs has been well studied, whereas there are very few results for coloring problems on directed graphs. An oriented k-coloring of an oriented graph G =
Frank Gurski +2 more
doaj +3 more sources
on Graceful Chromatic Number of Vertex amalgamation of Tree Graph Family
Cauchy: Jurnal Matematika Murni dan Aplikasi, 2022 Proper vertex coloring c of a graph G is a graceful coloring if c is a graceful k-coloring for k∈{1,2,3,…}. Definition graceful k-coloring of a graph G=(V,E) is a proper vertex coloring c:V(G)→{1,2,…,k);k≥2, which induces a proper edge coloring c':E(G ...
Arika Indah Kristiana +3 more
doaj +1 more source
Barekeng, 2023 Rainbow antimagic coloring is a combination of antimagic labeling and rainbow coloring. Antimagic labeling is labeling of each vertex of the graph with a different label, so that each the sum of the vertices in the graph has a different weight. Rainbow
R Adawiyah +4 more
doaj +1 more source
Edge Coloring Of Complement Bipolar Fuzzy Graphs
Ratio Mathematica, 2023 : Graph coloring is one of the most important problems of combinatorial optimization. Many problems of practical interest can be modeled as coloring problems.
S. Yahya Mohamed, Subashini N
doaj +1 more source
Generalisasi Bilangan Kromatik Pada Beberapa Kelas Graf Korona
Jurnal Derivat, 2022 For example is a chromatic number with the smallest integer so that the graph has a true vertex coloring with k color. Chromatic number is still an interesting study which is still being studied for its development through graph coloring.
Riduan Yusuf +3 more
doaj +1 more source
On harmonious chromatic number of triple star graph [PDF]
Journal of Hyperstructures, 2016 A Harmonious coloring of a graph G is a proper vertex coloring of G, in which every pair of colors appears on at most one pair of adjacent vertices and the harmonious chromatic number of graph G is the minimum number of colors needed for the harmonious ...
Akhlak Mansuri
doaj +1 more source
On Irregular Colorings of Unicyclic Graph Family
Cauchy: Jurnal Matematika Murni dan Aplikasi, 2023 Irregular coloring is a proper coloring and each vertex on a graph must have a different code. The color code of a vertex v is where and is the number of vertices that are adjacent to v and colored i.
Arika Indah Kristiana +4 more
doaj +1 more source
Solving Graph Coloring Problem Based on Grover Algorithm [PDF]
Jisuanji kexue, 2023 Grover quantum search algorithm is a famous quantum algorithm designed for unstructured search problems.It can be used to solve problems such as graph coloring and shortest path sorting,and can also effectively decipher cryptosystems.Graph coloring ...
LIU Xiaonan, LIU Zhengyu, XIE Haoshan, ZHAO Chenyan
doaj +1 more source
A Survey on the Cyclic Coloring and its Relaxations
Discussiones Mathematicae Graph Theory, 2021 A cyclic coloring of a plane graph is a vertex coloring such that any two vertices incident with the same face receive distinct colors. This type of coloring was introduced more than fifty years ago, and a lot of research in chromatic graph theory was ...
Czap Július +2 more
doaj +1 more source
An Inclusive Local Irregularity Vertex Coloring of Dutch Windmill Graph
Cauchy: Jurnal Matematika Murni dan Aplikasi, 2023 Let G(V,E) is a simple and connected graph with V(G) as vertex set and E(G) as edge set. An inclusive local irregularity vertex coloring is a development of the topic of local irregularity vertex coloring. An inclusive local irregularity vertex coloring
Arika Indah Kristiana +2 more
doaj +1 more source