Results 31 to 40 of about 34,319 (321)
Single Valued Neutrosophic R-dynamic Vertex Coloring of Graphs [PDF]
Neutrosophic Sets and Systems, 2022 In 1998, Smarandache introduced the new theory - Neutrosophic sets. In order to achieve the best results in a current situation, policy makers must contend with uncertainty and unpredictability.
V. Aparna, N. Mohanapriya, Said Broumi
doaj +1 more source
On facial unique-maximum (edge-)coloring [PDF]
, 2017 A facial unique-maximum coloring of a plane graph is a vertex coloring where on each face $\alpha$ the maximal color appears exactly once on the vertices of $\alpha$.
Andova, Vesna +4 more
core +3 more sources
Acyclic orientations with path constraints [PDF]
, 2005 Many well-known combinatorial optimization problems can be stated over the set of acyclic orientations of an undirected graph. For example, acyclic orientations with certain diameter constraints are closely related to the optimal solutions of the vertex ...
Bermond +8 more
core +2 more sources
Global Dominator Chromatic Number of Certain Graphs [PDF]
Mathematics Interdisciplinary ResearchFor a graph G=(V,E) and a vertex subset $D\subseteq V$, a vertex $v\in V$ is called a dominator of D if v is adjacent to every vertex in D, and an anti-dominator of D if v is not adjacent to any vertex in D. Given a coloring $C=\{V_{1},V_{2},\ldots,
Hadi Nouri Samani +2 more
doaj +1 more source
Smarandachely Adjacent Vertex Distinguishing Edge Coloring Algorithm of Graphs [PDF]
Jisuanji gongcheng, 2017 To solve the problem of Smarandachely Adjacent Vertex Distinguishing Edge Coloring(SAVDEC) of graphs,this paper presents a coloring algorithm based on multi-objective optimization.For each sub problem,the sub objective function vector and decision space ...
CAO Daotong,LI Jingwen,WEN Fei
doaj +1 more source
Vertex-Coloring with Star-Defects [PDF]
, 2016 Defective coloring is a variant of traditional vertex-coloring, according to which adjacent vertices are allowed to have the same color, as long as the monochromatic components induced by the corresponding edges have a certain structure. Due to its important applications, as for example in the bipartisation of graphs, this type of coloring has been ...
ANGELINI, PATRIZIO +3 more
openaire +3 more sources
A linear algorithm for the grundy number of a tree
, 2014 A coloring of a graph G = (V,E) is a partition {V1, V2, . . ., Vk} of V into independent sets or color classes. A vertex v Vi is a Grundy vertex if it is adjacent to at least one vertex in each color class Vj .
Bouhlel, Mohamed Salim, Mansouri, Ali
core +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
A Note on Polynomial Algorithm for Cost Coloring of Bipartite Graphs with Δ ≤ 4
Discussiones Mathematicae Graph Theory, 2020 In the note we consider vertex coloring of a graph in which each color has an associated cost which is incurred each time the color is assigned to a vertex. The cost of coloring is the sum of costs incurred at each vertex.
Giaro Krzysztof, Kubale Marek
doaj +1 more source