Results 51 to 60 of about 1,522,114 (310)
On the Adjacent Strong Equitable Edge Coloring of Pn ∨ Pn, Pn ∨ Cn and Cn ∨ Cn
MATEC Web of Conferences, 2016 A proper edge coloring of graph G is called equitable adjacent strong edge coloring if colored sets from every two adjacent vertices incident edge are different,and the number of edges in any two color classes differ by at most one,which the required ...
Liu Jun +4 more
doaj +1 more source
New Bipartite Graph Techniques for Irregular Data Redistribution Scheduling
Algorithms, 2019 For many parallel and distributed systems, automatic data redistribution improves its locality and increases system performance for various computer problems and applications.
Qinghai Li, Chang Wu Yu
doaj +1 more source
A note on M_{2}-edge colorings of graphs [PDF]
Opuscula Mathematica, 2015 An edge coloring \(\varphi\) of a graph \(G\) is called an \(M_2\)-edge coloring if \(|\varphi(v)|\le2 \) for every vertex \(v\) of \(G\), where \(\varphi(v)\) is the set of colors of edges incident with \(v\). Let \(K_2(G)\) denote the maximum number of
Július Czap
doaj +1 more source
Barekeng, 2023 Rainbow antimagic coloring is a combination of antimagic labeling and rainbow coloring. Antimagic labeling is labeling of each vertex of the graph with a different label, so that each the sum of the vertices in the graph has a different weight. Rainbow
R Adawiyah +4 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
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
Deterministic distributed edge-coloring with fewer colors [PDF]
Symposium on the Theory of Computing, 2017 We present a deterministic distributed algorithm, in the LOCAL model, that computes a (1+o(1))Δ-edge-coloring in polylogarithmic-time, so long as the maximum degree Δ=Ω(logn). For smaller Δ, we give a polylogarithmic-time 3Δ/2-edge-coloring.
M. Ghaffari +3 more
semanticscholar +1 more source
On Edge Coloring Bipartite Graphs [PDF]
SIAM Journal on Computing, 1982 The present paper shows how to find a minimal edge coloring of a bipartite graph with E edges and V vertices in time $O(E\log V)$.
Cole, Richard, Hopcroft, John
openaire +1 more source
On edge-colored saturation problems [PDF]
Journal of Combinatorics, 2020 Let $\mathcal{C}$ be a family of edge-colored graphs. A $t$-edge colored graph $G$ is $(\mathcal{C}, t)$-saturated if $G$ does not contain any graph in $\mathcal{C}$ but the addition of any edge in any color in $[t]$ creates a copy of some graph in $\mathcal{C}$. Similarly to classical saturation functions, define $\mathrm{sat}_t(n, \mathcal{C})$ to be
Ferrara, Michael +8 more
openaire +2 more sources
On Rainbow Antimagic Coloring of Joint Product of Graphs
Cauchy: Jurnal Matematika Murni dan Aplikasi, 2023 Let be a connected graph with vertex set and edge set . A bijection from to the set is a labeling of graph . The bijection is called rainbow antimagic vertex labeling if for any two edge and in path , where and .
Brian Juned Septory +3 more
doaj +1 more source