Results 91 to 100 of about 380,403 (285)
Bioinspired Design of Isotropic Lattices with Tunable and Controllable Anisotropy
Advanced Engineering Materials, EarlyView.This study introduces nested isotropic lattices, integrating architectural elements like nesting orders and orientations inspired by bioarchitectures. The design enables tunable anisotropy across nine mono‐nest and twenty multi‐nest lattices with 252 parametric variations, demonstrating transitions from shear‐ to tensile‐compression‐dominant behaviors ...
Ramalingaiah Boda +2 more
wiley +1 more source
Are highly connected 1-planar graphs Hamiltonian? [PDF]
arXiv, 2019 It is well-known that every planar 4-connected graph has a Hamiltonian cycle. In this paper, we study the question whether every 1-planar 4-connected graph has a Hamiltonian cycle. We show that this is false in general, even for 5-connected graphs, but true if the graph has a 1-planar drawing where every region is a triangle.
arxiv
Advanced Engineering Materials, EarlyView.Using novel probe‐based metrics, this study evaluates lattice structures on criteria critical to cellular solid optimization. Triply‐periodic minimal surface (TPMS) lattices outperform other lattices, offering more predictable mechanical behavior in complex design spaces and, as a result, higher performance in optimized models.
Firas Breish +2 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 +2 more
doaj +1 more source
Light edges in 1-planar graphs with prescribed minimum degree
Discussiones Mathematicae Graph Theory, 2012 Institute of Mathematics, Faculty of Science,Pavol Jozef Safa´rik University,ˇJesenn´a 5, 040 01 Koˇsice, Slovakiae-mail: {david.hudak,peter.sugerek}@student.upjs.skAbstractA graph is called 1-planar if it can be drawn in the plane so that eachedge is ...
Dávid Hudák, Peter Šugerek
semanticscholar +1 more source
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
Elastic‐Wave Propagation in Chiral Metamaterials: A Couple‐Stress Theory Perspective
Advanced Engineering Materials, EarlyView.The intrinsic chirality of chiral metamaterials renders an effective medium based on the classical continuum theory ineffective for predicting their acoustic activity. This limitation is addressed in the present study by employing augmented asymptotic homogenization to derive a couple‐stress‐based effective medium, enabling accurate predictions in the ...
Shahin Eskandari +5 more
wiley +1 more source
On properties of maximal 1-planar graphs
Discussiones Mathematicae Graph Theory, 2012 Department of Mathematics, Faculty of ScienceNiigata University8050, Ikarashi 2-no-cho, Nishi-ku, Niigata, 950-2181, Japane-mail: y-suzuki@math.sc.niigata-u.ac.jpAbstractA graph is called 1-planar if there exists a drawing in the plane so thateach edge ...
Dávid Hudák, T. Madaras, Yusuke Suzuki
semanticscholar +1 more source
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
Strong Chromatic Index Of Planar Graphs With Large Girth
Discussiones Mathematicae Graph Theory, 2014 Let Δ ≥ 4 be an integer. In this note, we prove that every planar graph with maximum degree Δ and girth at least 1 Δ+46 is strong (2Δ−1)-edgecolorable, that is best possible (in terms of number of colors) as soon as G contains two adjacent vertices of ...
Jennhwa Chang Gerard +3 more
doaj +1 more source