Results 11 to 20 of about 213,308 (160)
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
International Journal of Global Operations Research, 2022 In this paper we present an exact algorithm for the maximum-weight clique problem on arbitrary undirected graphs. The algorithm based on a fact that vertices from the same independent set couldn’t be included into the same maximum clique.
M. Suyudi
semanticscholar +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
Deterministic Distributed Vertex Coloring: Simpler, Faster, and without Network Decomposition [PDF]
IEEE Annual Symposium on Foundations of Computer Science, 2020 We present a simple deterministic distributed algorithm that computes a ($\Delta+1$)-vertex coloring in $O(\text{log}^{2}\Delta. \text{log}\ n)$ rounds. The algorithm can be implemented with $O(\text{log}\ n)$-bit messages.
M. Ghaffari, F. Kuhn
semanticscholar +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 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
Iterated local search with tabu search for the weighted vertex coloring problem
Computers & Operations Research, 2021 This paper proposes an iterated local search (ILS) based heuristic for the weighted vertex coloring problem (WVCP). Given a graph G ( V , E ) with a weight w ( v ) associated with each vertex v ∈ V , the WVCP asks to find a coloring { V 1 , … , V k } of ...
B. Nogueira, E. Tavares, P. Maciel
semanticscholar +1 more source
A New Vertex Coloring Heuristic and Corresponding Chromatic Number [PDF]
Algorithmica, 2020 One method to obtain a proper vertex coloring of graphs using a reasonable number of colors is to start from any arbitrary proper coloring and then repeat some local re-coloring techniques to reduce the number of color classes.
M. Zaker
semanticscholar +1 more source
ON LOCAL IRREGULARITY OF THE VERTEX COLORING OF THE CORONA PRODUCT OF A TREE GRAPH
Ural Mathematical Journal, 2022 Let \(G=(V,E)\) be a graph with a vertex set \(V\) and an edge set \(E\). The graph \(G\) is said to be with a local irregular vertex coloring if there is a function \(f\) called a local irregularity vertex coloring with the properties: (i) \(l:(V(G ...
Arika Indah Kristiana +5 more
doaj +1 more source
On local irregularity vertex coloring of comb product on star graphs
, 2021 Let G = (V,E) be a graph with vertex set V and edge set E. The graph G is said to be a local irregular vertex coloring if there is a function f is a called a local irregularity vertex coloring if : (i) l : (V (G)) → {1, 2,…,k} as a vertex irregular k ...
I. L. Mursyidah +4 more
semanticscholar +1 more source