Results 51 to 60 of about 92,928 (333)
A note on M_{2}-edge colorings of graphs [PDF]
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
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
Improved Edge-Coloring with Three Colors
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
Smarandachely Adjacent Vertex Distinguishing Edge Coloring Algorithm of Graphs [PDF]
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
The Complexity of Distributed Edge Coloring with Small Palettes
The complexity of distributed edge coloring depends heavily on the palette size as a function of the maximum degree $\Delta$. In this paper we explore the complexity of edge coloring in the LOCAL model in different palette size regimes. 1.
Chang, Yi-Jun +4 more
core +1 more source
Cells must clear mislocalized or faulty proteins from membranes to survive. The AAA+ ATPase Msp1 performs this task, but dissecting how its six subunits work together is challenging. We engineered linked dimers with varied numbers of functional subunits to reveal how Msp1 subunits cooperate and use energy to extract proteins from the lipid bilayer ...
Deepika Gaur +5 more
wiley +1 more source
On Rainbow Antimagic Coloring of Joint Product of Graphs
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
Vertex-Coloring 2-Edge-Weighting of Graphs [PDF]
A $k$-{\it edge-weighting} $w$ of a graph $G$ is an assignment of an integer weight, $w(e)\in \{1,\dots, k\}$, to each edge $e$. An edge weighting naturally induces a vertex coloring $c$ by defining $c(u)=\sum_{u\sim e} w(e)$ for every $u \in V(G)$. A $k$
Lu, Hongliang +2 more
core
Symmetric colorings of polypolyhedra
Polypolyhedra (after R. Lang) are compounds of edge-transitive 1-skeleta. There are 54 topologically different polypolyhedra, and each has icosidodecahedral, cuboctahedral, or tetrahedral symmetry, all are realizable as modular origami models with one ...
Belcastro, Sarah-Marie, Hull, Thomas C.
core +1 more source
The role of fibroblast growth factors in cell and cancer metabolism
Fibroblast growth factor (FGF) signaling regulates crucial signaling cascades that promote cell proliferation, survival, and metabolism. Therefore, FGFs and their receptors are often dysregulated in human diseases, including cancer, to sustain proliferation and rewire metabolism.
Jessica Price, Chiara Francavilla
wiley +1 more source

