Results 91 to 100 of about 147,831 (333)
Advanced Engineering Materials, EarlyView.Molecular dynamics simulations are advancing the study of ribonucleic acid (RNA) and RNA‐conjugated molecules. These developments include improvements in force fields, long‐timescale dynamics, and coarse‐grained models, addressing limitations and refining methods.
Kanchan Yadav, Iksoo Jang, Jong Bum Lee
wiley +1 more source
Discrete Applied Mathematics, 2017 A graph is NIC-planar if it admits a drawing in the plane with at most one crossing per edge and such that two pairs of crossing edges share at most one common end vertex. NIC-planarity generalizes IC-planarity, which allows a vertex to be incident to at most one crossing edge, and specializes 1-planarity, which only requires at most one crossing per ...
Franz J. Brandenburg +4 more
openaire +2 more sources
Deformation Behavior of La2O3‐Doped Copper during Equal Channel Angular Pressing
Advanced Engineering Materials, EarlyView.By additions of strengthening elements and/or structure optimization, the mechanical properties of copper can be increased while keeping favorable electric conductivity. By combining addition of La2O3 and processing by equal channel angular pressing, substructure development is achieved, leading to increase in microhardness to more than double the ...
Lenka Kunčická +2 more
wiley +1 more source
Uniquely identifying the vertices of pendant-free tricyclic graphs
Ain Shams Engineering JournalPlanar interconnection networks are essential in VLSI circuit design because they provide efficient layouts that minimize wire use, reduce manufacturing costs, and prevent wire crossings.
Hariharan S, Mohana N
doaj +1 more source
An Analogue of DP-Coloring for Variable Degeneracy and its Applications
Discussiones Mathematicae Graph Theory, 2022 A graph G is list vertex k-arborable if for every k-assignment L, one can choose f(v) ∈ L(v) for each vertex v so that vertices with the same color induce a forest. In [6], Borodin and Ivanova proved that every planar graph without 4-cycles adjacent to 3-
Sittitrai Pongpat, Nakprasit Kittikorn
doaj +1 more source
Uniform random sampling of planar graphs in linear time [PDF]
, 2007 This article introduces new algorithms for the uniform random generation of labelled planar graphs. Its principles rely on Boltzmann samplers, as recently developed by Duchon, Flajolet, Louchard, and Schaeffer.
Fusy, Eric
core +6 more sources
The Weisfeiler-Leman Dimension of Planar Graphs is at most 3
, 2017 We prove that the Weisfeiler-Leman (WL) dimension of the class of all finite planar graphs is at most 3. In particular, every finite planar graph is definable in first-order logic with counting using at most 4 variables.
Kiefer, Sandra +2 more
core +1 more source
Advanced Engineering Materials, EarlyView.In this research, ZrC coatings are evaluated against various counterprobes at the microscale using novel super‐stiff atomic force microscopy cantilevers. The chemical composition of the coating is shown to be an important factor influencing coating hardness and Young's modulus, while surface roughness, counterprobe hardness, and surface energy are the ...
Piotr Jenczyk +4 more
wiley +1 more source
WORM Colorings of Planar Graphs
Discussiones Mathematicae Graph Theory, 2017 Given three planar graphs F,H, and G, an (F,H)-WORM coloring of G is a vertex coloring such that no subgraph isomorphic to F is rainbow and no subgraph isomorphic to H is monochromatic. If G has at least one (F,H)-WORM coloring, then W−F,H(G) denotes the
Czap J., Jendrol’ S., Valiska J.
doaj +1 more source
Advanced Engineering Materials, EarlyView.A new experimental setup, incorporating digital image correlation and infrared thermography in combination with inductive‐conductive heating for precise temperature control, is used to analyze the mechanical behavior and microstructural changes of sheet metal under complex thermomechanical test conditions that represent quench and partitioning ...
Christian Illgen +4 more
wiley +1 more source