Results 1 to 10 of about 18,582 (315)

Graph Coloring with webMathematica [PDF]

, 2004
Coloring of a graph is an assignment of colors either to the edges of the graph G, or to vertices, or to maps in such a way that adjacent edges/vertices/maps are colored differently. We consider the problem of coloring graphs by using webMathematica which is the new web-based technology. In this paper, we describe some web-based interactive examples on
Ünal Ufuktepe, Goksen Bacak, Tina Beseri   +2 more
core   +4 more sources

Efficient and Robust Graph Coloring Algorithm for Graph Coloring Problem: Malatya Vertex Coloring Algorithm

IEEE Access
The graph coloring problem involves coloring the nodes of a graph using the minimum number of colors such that no two adjacent nodes share the same color.
Selman Yakut
doaj   +2 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, Ahmad Aji, Edy Wihardjo, Deddy Setiawan   +3 more
doaj   +1 more source

ON RAINBOW ANTIMAGIC COLORING OF SNAIL GRAPH(S_n ), COCONUT ROOT GRAPH (Cr_(n,m) ), FAN STALK GRAPH (Kt_n ) AND THE LOTUS GRAPH(Lo_n )

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, I I Makhfudloh, Dafik Dafik, RM Prihandini, AC Prihandoko   +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

Coloring Drawings of Graphs [PDF]

The Electronic Journal of Combinatorics, 2022
We consider cell colorings of drawings of graphs in the plane. Given a multi-graph $G$ together with a drawing $\Gamma(G)$ in the plane with only finitely many crossings, we define a cell $k$-coloring of $\Gamma(G)$ to be a coloring of the maximal connected regions of the drawing, the cells, with $k$ colors such that adjacent cells have different ...
Christoph Hertrich, Felix Schröder, Raphael Steiner   +2 more
openaire   +2 more sources

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, Fitria Puspa Dewi, Firmansyah, Abdul Mujib   +3 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

Graph coloring with rejection [PDF]

Journal of Computer and System Sciences, 2006
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Leah Epstein, Asaf Levin, Gerhard J. Woeginger   +2 more
openaire   +3 more sources

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