Results 101 to 110 of about 200,785 (277)

Additive List Coloring of Planar Graphs with Given Girth

Discussiones Mathematicae Graph Theory, 2020
An additive coloring of a graph G is a labeling of the vertices of G from {1, 2, . . . , k} such that two adjacent vertices have distinct sums of labels on their neighbors.
Brandt Axel, Jahanbekam Sogol, White Jennifer   +2 more
doaj   +1 more source

Rational Device Design and Doping‐Controlled Performance in Fast‐Response π‐Ion Gel Transistors

Advanced Functional Materials, EarlyView.
π‐Ion gel transistors (PIGTs) achieve extraordinary transconductance and stability through device configuration optimization, high‐mobility conjugated polymer selection, and hole scavenger doping. The optimized PIGTs maintain performance on flexible substrates, enabling printed, fast‐response, and wearable electronics.
Masato Kato, Soh Kushida, Nafees Umar Draz, Dan Kyotani, Emanuel Smarsly, Kyota Yoshinaga, Wenhao He, Uwe H. F. Bunz, Kazuhiro Marumoto, Tatsuya Mori, Yohei Yamamoto   +10 more
wiley   +1 more source

Coexisting Rashba/Dresselhaus Spin Splitting in Solution‐Processed Bournonite Films Using Circular Photogalvanic Effect

Advanced Functional Materials, EarlyView.
Circular photogalvanic effect measurements and first‐principles calculations reveal spin‐splitting states in solution‐processed bournonite films (CuPbSbS3) due to structural and bulk inversion asymmetry. The results provide experimental confirmation of coexisting Rashba and Dresselhaus spin‐splitting states in this non‐centrosymmetric chalcogenide ...
Aeron McConnell, Sasa Wang, Andrew Grieder, Yuan Ping, David B. Mitzi, Dali Sun   +5 more
wiley   +1 more source

Large matchings in maximal 1-planar graphs

Discrete Mathematics
It is well-known that every maximal planar graph has a matching of size at least $\tfrac{n+8}{3}$ if $n\geq 14$. In this paper, we investigate similar matching-bounds for maximal \emph{1-planar} graphs, i.e., graphs that can be drawn such that every edge has at most one crossing.
Therese Biedl, John Wittnebel
openaire   +2 more sources

Recognizing Optimal 1-Planar Graphs in Linear Time [PDF]

Algorithmica, 2016
A graph with n vertices is 1-planar if it can be drawn in the plane such that each edge is crossed at most once, and is optimal if it has the maximum of 4n-8 edges. We show that optimal 1-planar graphs can be recognized in linear time. Our algorithm implements a graph reduction system with two rules, which can be used to reduce every optimal 1-planar ...
openaire   +3 more sources

Circular‐Polarization‐Sensitive Organic Photodetectors with a Chiral Nanopatterned Electrode Inverse‐Designed by Genetic Algorithm

Advanced Functional Materials, EarlyView.
A chiral photodetector capable of selectively distinguishing left‐ and right‐handed circularly polarized light is experimentally demonstrated. The device, which features a nanopatterned electrode inverse‐designed by a genetic algorithm within a metal–dielectric–metal nanocavity that incorporates a vacuum‐deposited small‐molecule multilayer, exhibits ...
Kyung Ryoul Park, Jewoong Lee, In‐Suk Choi, Changsoon Kim   +3 more
wiley   +1 more source

On Independent Domination in Planar Cubic Graphs

Discussiones Mathematicae Graph Theory, 2019
A set S of vertices in a graph G is an independent dominating set of G if S is an independent set and every vertex not in S is adjacent to a vertex in S.
Abrishami Gholamreza, Henning Michael A., Rahbarnia Freydoon   +2 more
doaj   +1 more source

Geometry‐Dependent Adhesion in Transparent Monodomain Liquid Crystal Elastomers

Advanced Functional Materials, EarlyView.
Liquid Crystal Elastomers (LCEs) are emerging as exciting pressure‐sensitive adhesives. We examine adhesion in chemically identical elastomer films, exploring the influence of geometry (director orientation) and phase (nematic or isotropic). We demonstrate the potential of these aligned films as transparent, tunable, broad‐temperature‐range smart ...
Aidan Street, Devesh Mistry, Johan Mattsson, Helen F. Gleeson   +3 more
wiley   +1 more source

Infrared Nanocrystals for Space Application: Hardness to Irradiations

Advanced Functional Materials, EarlyView.
This article investigates infrared HgTe nanocrystals under X‐ray and ion irradiation, revealing remarkable radiation hardness. It uncovers distinct degradation mechanisms and shows that the nanomaterial outperforms integrated electronics. The results position colloidal nanocrystals as promising candidates for resilient space and harsh‐environment ...
Alexandre Neyret, Dario Mastrippolito, Bingbing Xia, Adrien Khalili, Maxime Lebreton, Giorgia Strobbia, Albin Colle, Marco Paye, Mariarosa Cavallo, Erwan Bossavit, Claire Abadie, Yoann Prado, Debora Pierucci, Victor Parahyba, Francois Coursaget, David Darson, Emrick Briand, Ian Vickridge, Stephane Demiguel, Sebastien Massenot, Jean‐Marc Belloir, Vincent Goiffon, Emmanuel Lhuillier   +22 more
wiley   +1 more source

Strong oriented chromatic number of planar graphs without short cycles

Discrete Mathematics & Theoretical Computer Science, 2008
Let M be an additive abelian group. A strong oriented coloringof an oriented graph G is a mapping φ from V(G) to M such that (1) φ(u) ≠ φ(v) whenever uv is an arc in G and (2) φ(v) - φ(u) ≠ -(φ(t) - φ(z)) whenever uv and zt are two arcs in
Mickaël Montassier, Pascal Ochem, Alexandre Pinlou   +2 more
doaj