Results 11 to 20 of about 34,319 (321)
On Vertex Coloring Without Monochromatic Triangles [PDF]
, 2018 Extended ...
Karpiński, Michał, Piecuch, Krzysztof
openaire +3 more sources
Vertex-Coloring 2-Edge-Weighting of Graphs [PDF]
, 2010 A $k$-{\it edge-weighting} $w$ of a graph $G$ is an assignment of an integer weight, $w(e)\in \{1,\dots, k\}$, to each edge $e$. An edge weighting naturally induces a vertex coloring $c$ by defining $c(u)=\sum_{u\sim e} w(e)$ for every $u \in V(G)$. A $k$
Hongliang Lu +2 more
openalex +4 more sources
PEWARNAAN TITIK TOTAL SUPER ANTI-AJAIB LOKAL PADA GRAF PETERSEN DIPERUMUM P(n,k) DENGAN k=1,2
Barekeng, 2021 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
LOCAL IRREGULARITY POINT COLORING ON THE RESULT OF SUBDIVISION OPERATION OF HELM GRAPHS
Jurnal Diferensial, 2023 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
Pewarnaan Titik Ketakteraturan Lokal Inklusif pada Hasil Operasi Comb Graf Bintang
Contemporary Mathematics and Applications (ConMathA), 2022 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
Pewarnaan Titik Ketakteraturan Lokal Inklusif pada Keluarga Graf Unicyclic
Contemporary Mathematics and Applications (ConMathA), 2022 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
AVD edge-colorings of cubic Halin graphs
AIMS Mathematics, 2023 The adjacent vertex-distinguishing edge-coloring of a graph $ G $ is a proper edge-coloring of $ G $ such that each pair of adjacent vetices receives a distinct set of colors.
Ningge Huang , Lily Chen
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
Scheduling Problems and Generalized Graph Coloring [PDF]
Discrete Mathematics & Theoretical Computer Science, 2020 We define a new type of vertex coloring which generalizes vertex coloring in graphs, hypergraphs, andsimplicial complexes. To this coloring there is an associated symmetric function in noncommuting variables for whichwe give a deletion-contraction ...
John Machacek
doaj +1 more source
Dynamic Algorithms for Graph Coloring [PDF]
, 2017 We design fast dynamic algorithms for proper vertex and edge colorings in a graph undergoing edge insertions and deletions. In the static setting, there are simple linear time algorithms for $(\Delta+1)$- vertex coloring and $(2\Delta-1)$-edge coloring ...
Bhattacharya, Sayan +3 more
core +2 more sources