Results 11 to 20 of about 5,891 (239)
Group twin coloring of graphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2018 For a given graph $G$, the least integer $k\geq 2$ such that for every Abelian group $\mathcal{G}$ of order $k$ there exists a proper edge labeling $f:E(G)\rightarrow \mathcal{G}$ so that $\sum_{x\in N(u)}f(xu)\neq \sum_{x\in N(v)}f(xv)$ for each edge ...
Sylwia Cichacz, Jakub Przybyło
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
Discrete Mathematics & Theoretical Computer ScienceWe introduce coloring groups, which are permutation groups obtained from a proper edge coloring of a graph. These groups generalize the generalized toggle groups of Striker (which themselves generalize the toggle groups introduced by Cameron and Fon-der ...
Ben Adenbaum, Alexander Wilson
doaj +1 more source
Consecutive colorings of the edges of general graphs
Discrete Mathematics, 2001 A consecutive (or interval) edge-coloring of a graph \(G = (V, E)\) is a map \(f : E \rightarrow \mathbb{N}\) such that the colors of edges at each vertex are distinct and form an interval of integers. It follows from the well-known NP-completenes result for edge-colorings that deciding whether a graph is consecutive edge-colorable is NP-complete.
Krzysztof Giaro +2 more
openaire +1 more source
Colored motifs reveal computational building blocks in the C. elegans brain. [PDF]
PLoS ONE, 2011 BACKGROUND: Complex networks can often be decomposed into less complex sub-networks whose structures can give hints about the functional organization of the network as a whole.
Jifeng Qian +2 more
doaj +1 more source
A generalization of interval edge-colorings of graphs
Discrete Applied Mathematics, 2010 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Petros A. Petrosyan +2 more
openaire +2 more sources
On a Total Version of 1-2-3 Conjecture
Discussiones Mathematicae Graph Theory, 2020 A total k-coloring of a graph G is a coloring of vertices and edges of G using colors of the set {1, . . . , k}. These colors can be used to distinguish adjacent vertices of G. There are many possibilities of such a distinction.
Baudon Olivier +5 more
doaj +1 more source
The Black-and-White Coloring Problem on Chordal Graphs
Journal of Graph Algorithms and Applications, 2012 Given a graph G and positive integers b and w, the black-and-white coloring problem asks about the existence of a partial vertex-coloring of G, with b vertices colored black and w white, such that there is no edge between a black and a white vertex. This
Shira Zucker
doaj +1 more source
Edge-state-induced correlation effects in two-color high-harmonic generation [PDF]
Physical Review A, 2020 6 pages, 4 ...
Jensen, Simon Vendelbo Bylling +2 more
openaire +4 more sources
A Note on Neighbor Expanded Sum Distinguishing Index
Discussiones Mathematicae Graph Theory, 2017 A total k-coloring of a graph G is a coloring of vertices and edges of G using colors of the set [k] = {1, . . . , k}. These colors can be used to distinguish the vertices of G. There are many possibilities of such a distinction.
Flandrin Evelyne +4 more
doaj +1 more source