Results 81 to 90 of about 33,621 (316)
Distributed Deterministic Edge Coloring using Bounded Neighborhood Independence [PDF]
We study the {edge-coloring} problem in the message-passing model of distributed computing. This is one of the most fundamental and well-studied problems in this area.
Barenboim, Leonid, Elkin, Michael
core
Intelligent radiative cooling devices, adaptable to various weather conditions, have the potential for year‐round energy savings. This study introduces a sustainable dual‐mode film made from polycaprolactone nanofibers and upcycled chip bags for effective thermal management.
Qimeng Song +4 more
wiley +1 more source
The Locating Chromatic Number of Book Graph
Let G=VG,EG be a connected graph and c:VG⟶1,2,…,k be a proper k-coloring of G. Let Π be a partition of vertices of G induced by the coloring c. We define the color code cΠv of a vertex v∈VG as an ordered k-tuple that contains the distance between each ...
Nur Inayah +2 more
doaj +1 more source
Modular Coloring and Switching in Some Planar Graphs
For a connected graph G, let c: V (G) →ℤk (k ≥ 2) be a vertex coloring of G. The color sum \sigma(v) of a vertex v of G is defined as the sum in ℤk of the colors of the vertices in N (v) that is (v) = \sum_{u\inN(v)}{c(u)} (mod k).
G. R Sanma, P Maya
doaj +1 more source
An exact approach for the Vertex Coloring Problem
AbstractGiven an undirected graph G=(V,E), the Vertex Coloring Problem (VCP) requires to assign a color to each vertex in such a way that colors on adjacent vertices are different and the number of colors used is minimized. In this paper, we present an exact algorithm for the solution of VCP based on the well-known Set Covering formulation of the ...
MALAGUTI, ENRICO +2 more
openaire +3 more sources
HKUST‐1/TiO2 composite materials show a very high photocatalytic hydrogen evolution rate which increases as a function of the irradiation time until reaching a plateau and even surpasses the performance of the 1%Pt/TiO2 material after three photocatalytic cycles.
Alisha Khan +9 more
wiley +1 more source
Machine Learning‐Enabled Polymer Discovery for Enhanced Pulmonary siRNA Delivery
This study provides an efficient approach to train a machine learning model by merging heterogeneous literature data to predict suitable polymers for siRNA delivery. Without the need for extensive laboratory synthesis, the machine learning enabled a virtual screening and successfully predicted a polymer that is validated for effective gene silencing in
Felix Sieber‐Schäfer +10 more
wiley +1 more source
Improved Bounds for Some Facially Constrained Colorings
A facial-parity edge-coloring of a 2-edge-connected plane graph is a facially-proper edge-coloring in which every face is incident with zero or an odd number of edges of each color. A facial-parity vertex-coloring of a 2-connected plane graph is a proper
Štorgel Kenny
doaj +1 more source
EVEN VERTEX COLORING OF A GRAPH [PDF]
As a generalization of Harary's notion of consistency in marked graphs, we define define an even vertex coloring of a graph G as an assignment of colors to the vertices of G such that in every cycle of G there is a nonzero even number of vertices of at least one color. The even vertex coloring number "v(G) of even-vertex colorable graph G is defined as
K.S. Permi, P.S.K. Reddy
openaire +2 more sources
By a simple anti‐Galvanic reaction, up to six copper atoms could be preferably doped into the Ag2(SR)5 staple motifs and Ag20 dodecahedral shell of an atomically precise Ag44(SR)30 nanocluster. When anatase TiO2 is used as substrate, the (AgCu)44/TiO2 photocatalyst exhibited much improved activity in photocatalytic CO2 reduction compared to Ag44/TiO2 ...
Ye Liu +5 more
wiley +1 more source

