Results 81 to 90 of about 119,953 (318)
The Incidence Chromatic Number of Toroidal Grids
Discussiones Mathematicae Graph Theory, 2013 An incidence in a graph G is a pair (v, e) with v ∈ V (G) and e ∈ E(G), such that v and e are incident. Two incidences (v, e) and (w, f) are adjacent if v = w, or e = f, or the edge vw equals e or f.
Sopena Éric, Wu Jiaojiao
doaj +1 more source
The Vegan Villain Sets Out to The End of Summer: Functionalized Coatings as Biohybrid UV‐Sensors
Advanced Materials Interfaces, EarlyView.This study introduces biohybrid coatings incorporating E. coli biomass expressing photoconvertible fluorescent proteins as UV‐A responsive elements. Upon irradiation at 400 nm, the coatings exhibit an irreversible fluorescence shift from green to red within 15 min. Notably, the photoconversion capability is retained after >1 year of storage.
Amelie Skopp +3 more
wiley +1 more source
Some Equal Degree Graph Edge Chromatic Number
MATEC Web of Conferences, 2016 Let G(V, E) be a simple graph and k is a positive integer, if it exists a mapping of f, and satisfied with f(e1)≠6 = f(e2) for two incident edges e1,e2∉E(G), f(e1)≠6=f(e2), then f is called the k-proper-edge coloring of G(k-PEC for short).
Liu Jun +4 more
doaj +1 more source
Borel chromatic number of closed graphs
, 2014 We construct, for each countable ordinal $\xi$, a closed graph with Borel chromatic number two and Baire class $\xi$ chromatic number $\aleph\_0$.Comment: The proof of the main lemma has been changed, and the main result is now better than in the ...
Lecomte, Dominique, Zeleny, Miroslav
core
Advanced Materials Technologies, EarlyView.A low‐cost, maskless visible light photopatterning system has been developed by combining a consumer‐grade projector with a single Fresnel lens, generating the Fresnel Lens Integrated Projector (FLIP) system. FLIP enables flexible photopatterning of solid and gel films with features down to 30 µm and 135 µm, respectively.
Sridaran Rajagopal +2 more
wiley +1 more source
Locating-Chromatic Number of Amalgamation of Stars
Journal of Mathematical and Fundamental Sciences, 2013 Let G be a connected graph and c a proper coloring of G . For i Æ’1,2,Æ’»,k define the color class i C as the set of vertices receiving color i . The color code c (v) "ž¨ of a vertex v in G is the ordered k -tuple 1 ( ( , ), , ( , )) k d v C Æ’» d v C ...
Asmiati Asmiati +2 more
doaj +1 more source
Advanced Materials Technologies, EarlyView.This critical review presents a comprehensive roadmap for the precision 3D printing of cellulose. Quantitative correlations link ink formulation and rheological properties to print fidelity and final material performance. This framework guides the development of advanced functional materials, from biomedical scaffolds to electromagnetic shielding ...
Majed Amini +3 more
wiley +1 more source
Modular chromatic number of $C_m square P_n$ [PDF]
Transactions on Combinatorics, 2013 A modular $k$-coloring, $kge 2,$ of a graph $G$ without isolated vertices is a coloring of the vertices of $G$ with the elements in $mathbb{Z}_k$ having the property that for every two adjacent vertices of $G,$ the sums of the colors of the neighbors are
N. Paramaguru, R. Sampathkumar
doaj
Journal of Symbolic Logic, 2008 AbstractWe show that if add(null) = c, then the globally Baire and universally measurable chromatic numbers of the graph of any Borel function on a Polish space are equal and at most three. In particular, this holds for the graph of the unilateral shift on [ℕ]ℕ, although its Borel chromatic number is ℵ0.
openaire +3 more sources