Results 21 to 30 of about 3,916 (152)
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
Journal of Graph Algorithms and Applications, 2017 Defective coloring is a variant of the traditional vertex-coloring in which adjacent vertices are allowed to have the same color, as long as the induced monochromatic components have a certain structure. Due to its important applications, as for example in the bipartisation of graphs, this type of coloring has been extensively studied, mainly with ...
Patrizio Angelini +9 more
openaire +2 more sources
Simple vertex coloring algorithms
CoRR, 2021 12 ...
Jackson Morris, Fang Song 0001
openaire +2 more sources
Vertex-Coloring Edge-Weighting of Bipartite Graphs with Two Edge Weights [PDF]
Discrete Mathematics & Theoretical Computer Science, 2016 Let $G$ be a graph and $\mathcal{S}$ be a subset of $Z$. A vertex-coloring $\mathcal{S}$-edge-weighting of $G$ is an assignment of weights by the elements of $\mathcal{S}$ to each edge of $G$ so that adjacent vertices have different sums of incident ...
Hongliang Lu
doaj +1 more source
AVD proper edge-coloring of some families of graphs
International Journal of Mathematics for Industry, 2021 Adjacent vertex-distinguishing proper edge-coloring is the minimum number of colors required for the proper edge-coloring of [Formula: see text] in which no two adjacent vertices are incident to edges colored with the same set of colors.
J. Naveen
doaj +1 more source
The majority coloring of the join and Cartesian product of some digraph [PDF]
MATEC Web of Conferences, 2022 A majority coloring of a digraph is a vertex coloring such that for every vertex, the number of vertices with the same color in the out-neighborhood does not exceed half of its out-degree.
Shi Mei +3 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 ...
Patrizio Angelini +3 more
openaire +3 more sources
Labeling, Covering and Decomposing of Graphs — Smarandache’s Notion in Graph Theory [PDF]
, 2010 This paper surveys the applications of Smarandache’s notion to graph theory appeared in International J.Math.Combin. from Vol.1,2008 to Vol.3,2009.
Mao, Linfan, Linfan Mao
core +1 more source
Vertex-vertex color energy of a graph
Sibirskie Elektronnye Matematicheskie Izvestiya, 2021 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Sayinath, Udupa, Bhat, R. S.
openaire +1 more source