Results 91 to 100 of about 45,382 (265)
, 2016 We prove a general multi-dimensional central limit theorem for the expected number of vertices of a given degree in the family of planar maps whose vertex degrees are restricted to an arbitrary (finite or infinite) set of positive integers D. Our results rely on a classical bijection with mobiles (objects exhibiting a tree structure), combined with ...
Collet, Gwendal +2 more
openaire +2 more sources
A hexahedral mesh connectivity compression with vertex degrees
Computer-Aided Design, 2008 This paper introduces a new algorithm for the compression of manifold hexahedral meshes topology, using vertex degree. The topology compression consists of two parts-the mesh's boundary consisting of quadrilaterals is compressed first, and then the hexahedra are processed by the help of six commands.
Krivograd, Sebastian +2 more
openaire +3 more sources
Giant Anisotropic Spin Absorption in Chiral Hybrid Semiconductors
Advanced Materials, EarlyView.Researchers uncover that chiral hybrid organic–inorganic semiconductors absorb spin differently depending on its polarization direction. This anisotropic spin absorption is primarily driven by the local symmetry breaking within the layered structure.
Cong Yang +12 more
wiley +1 more source
Efficient in‐Plane Exciton Transport in a Discontinuous Layered Lead‐Bromide Perovskite
Advanced Materials, EarlyView.A new class of two‐dimensional lead‐bromide perovskite based on monovalent 4‐aminomethylbenzoic acid cations is presented, featuring a discontinuous inorganic layer. Despite the discontinuous lattice, transient photoluminescence microscopy demonstrates efficient though strongly anisotropic in‐plane exciton transport.
Raquel Utrera‐Melero +9 more
wiley +1 more source
Spanning Trees whose Stems have a Bounded Number of Branch Vertices
Discussiones Mathematicae Graph Theory, 2016 Let T be a tree, a vertex of degree one and a vertex of degree at least three is called a leaf and a branch vertex, respectively. The set of leaves of T is denoted by Leaf(T).
Yan Zheng
doaj +1 more source
Advanced Materials, EarlyView.Oxidized Nd‐Fe‐B magnet swarf is transformed into valuable bulk feedstock through a single‐step hydrogen plasma process. The reaction converts complex rare‐earth‐containing waste into separated metallic, oxide, and hydride fractions without acid leaching.
Naritai Chimed +9 more
wiley +1 more source
Counting triangulations of fixed cardinal degrees
Journal of Computational GeometryA fixed set of vertices in the plane may have multiple planar straight-line triangulations in which the degree of each vertex is the same. As such, the degree information does not completely determine the triangulation. We show that even if we know, for
Erin Chambers +3 more
doaj +1 more source
Mechanoactive Biomaterials for Cell–Matrix Mechanotransduction
Advanced Materials, EarlyView.The graphical abstract shows how individual triggers (force, light, or temperature) and combined optothermal or receptor‐targeted actuation induce material responses at the tissue, cellular, and receptor scales. Their spatial (global or focused) and temporal (continuous or cyclic) modulation determines the resulting mechanical output.
Yi‐Tung Lu +2 more
wiley +1 more source
Some Inequalities between General Randić-Type Graph Invariants
Journal of MathematicsThe Randić-type graph invariants are extensively investigated vertex-degree-based topological indices and have gained much prominence in recent years.
Imran Nadeem, Saba Siddique, Yilun Shang
doaj +1 more source
Enumerating Minimal Vertex Covers and Dominating Sets with Capacity and/or Connectivity Constraints
AlgorithmsIn this paper, we consider the minimal vertex cover and minimal dominating sets with capacity and/or connectivity constraint enumeration problems. We develop polynomial-delay enumeration algorithms for these problems on bounded-degree graphs.
Yasuaki Kobayashi +4 more
doaj +1 more source