Results 1 to 10 of about 3,916 (152)
AN INCLUSIVE LOCAL IRREGULARITY VERTEX COLORING OF BOOK GRAPH FAMILY [PDF]
Let is a simple and connected graph with as vertex set and as edge set. Vertex labeling on inclusive local irregularity vertex coloring is defined by mapping and the function of the inclusive local irregularity vertex coloring is with .
Robiatul Adawiyah +2 more
doaj +3 more sources
An Inclusive Local Irregularity Vertex Coloring of Dutch Windmill Graph [PDF]
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 +3 more sources
An exact approach for the Vertex Coloring Problem
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Paolo Tóth +2 more
exaly +4 more sources
on Graceful Chromatic Number of Vertex amalgamation of Tree Graph Family
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
PEWARNAAN TITIK TOTAL SUPER ANTI-AJAIB LOKAL PADA GRAF PETERSEN DIPERUMUM P(n,k) DENGAN k=1,2
The local antimagic total vertex labeling of graph G is a labeling that every vertices and edges label by natural number from 1 to such that every two adjacent vertices has different weights, where is The sum of a vertex label and the labels of all ...
Deddy Setyawan +4 more
doaj +1 more source
Pewarnaan Titik Ketakteraturan Lokal Inklusif pada Hasil Operasi Comb Graf Bintang
Let G(V,E) is a simple graph and connected where V(G) is vertex set and E(G) is edge set. An inclusive local irregularity vertex coloring is defined by a mapping l:V(G) í {1,2,..., k} as vertex labeling and wi : V(G) í N is function of inclusive local ...
Arika Indah Kristiana +2 more
doaj +1 more source
LOCAL IRREGULARITY POINT COLORING ON THE RESULT OF SUBDIVISION OPERATION OF HELM GRAPHS
One of the sub-chapters studied in graphs is local irregularity vertex coloring of graph. The based on definition of local irregularity vertex coloring of graph, as follow : (i)l : V (G) →{1, 2, 3, . . . , k} as a vertex irregular labeling and w : V (G) →
Ilmiatun Nuroeni +4 more
doaj +1 more source
Colorful Paths in Vertex Coloring of Graphs [PDF]
A colorful path in a graph $G$ is a path with $\chi(G)$ vertices whose colors are different. A $v$-colorful path is such a path, starting from $v$. Let $G\neq C_7$ be a connected graph with maximum degree $\Delta(G)$. We show that there exists a $(\Delta(G)+1)$-coloring of $G$ with a $v$-colorful path for every $v\in V(G)$.
Saieed Akbari +2 more
openaire +2 more sources
Pewarnaan Titik Ketakteraturan Lokal Inklusif pada Keluarga Graf Unicyclic
The graph in this paper is a simple and connected graph with V(G) is vertex set and E(G) is edge set. An inklusif local irregularity vertex coloring is defined should be maping l:V(G) í {1,2,..., k} as vertex labeling and wi : V(G) í N is function of ...
Arika Indah Kristiana +2 more
doaj +1 more source
A survey on vertex coloring problems [PDF]
AbstractThis paper surveys the most important algorithmic and computational results on the Vertex Coloring Problem (VCP) and its generalizations. The first part of the paper introduces the classical models for the VCP, and discusses how these models can be used and possibly strengthened to derive exact and heuristic algorithms for the problem ...
MALAGUTI, ENRICO, TOTH, PAOLO
openaire +2 more sources

