Results 31 to 40 of about 1,904 (164)
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
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
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 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
LOCAL IRREGULARITY VERTEX COLORING OF BICYCLIC GRAPH FAMILIES
BarekengThe graph in this research is a simple and connected graph with as vertex set and as an edge set. We used deductive axiomatic and pattern recognition method.
Arika Indah Kristiana +5 more
doaj +1 more source
On Twin Edge Colorings of Graphs
Discussiones Mathematicae Graph Theory, 2014 A twin edge k-coloring of a graph G is a proper edge coloring of G with the elements of Zk so that the induced vertex coloring in which the color of a vertex v in G is the sum (in Zk) of the colors of the edges incident with v is a proper vertex coloring.
Andrews Eric +4 more
doaj +1 more source
Upper and lower bounds based on linear programming for the b-coloring problem
EURO Journal on Computational Optimization, 2022 B-coloring is a problem in graph theory. It can model some real applications, as well as being used to enhance solution methods for the classical graph coloring problem. In turn, improved solutions for the classical coloring problem would impact a larger
Roberto Montemanni +2 more
doaj +1 more source
Hierarchical and modularly-minimal vertex colorings
The Art of Discrete and Applied Mathematics, 2022 Cographs are exactly the hereditarily well-colored graphs, i.e., the graphs for which a greedy vertex coloring of every induced subgraph uses only the minimally necessary number of colors $χ(G)$. We show that greedy colorings are a special case of the more general hierarchical vertex colorings, which recently were introduced in phylogenetic ...
Valdivia, Dulce I. +4 more
openaire +3 more sources