Results 111 to 120 of about 196,583,728 (297)
A Parameterized Algorithm for Bounded-Degree Vertex Deletion [PDF]
, 2016 The $d$-bounded-degree vertex deletion problem, to delete at most $k$ vertices in a given graph to make the maximum degree of the remaining graph at most $d$, finds applications in computational biology, social network analysis and some others. It can be regarded as a special case of the $(d+2)$-hitting set problem and generates the famous vertex cover
openaire +3 more sources
Advanced Materials, EarlyView.Co1/3TaS2${\rm Co}_{1/3}{\rm TaS}_{2}$ hosts a triple‐Q noncoplanar antiferromagnetic state with coexisting Z3${\rm Z}_3$ electronic nematicity. We report rotational hysteresis observed in both magnetoresistance and magnetic torque, revealing strongly pinned in‐plane weak ferromagnetic moments in the triple‐Q phase and the magnetism‐driven nature of ...
Joonyoung Choi +5 more
wiley +1 more source
Exact Solutions of a Generalized Weighted Scale Free Network
Journal of Applied Mathematics, 2013 We investigate a class of generalized weighted scale-free networks, where the new vertex connects to m pairs of vertices selected preferentially. The key contribution of this paper is that, from the standpoint of random processes, we provide rigorous ...
Li Tan, Dingyou Lei
doaj +1 more source
Strong Fully Reprocessable Engineered Wood Composites
Advanced Materials, EarlyView.Engineering a hyperbranched adhesive with complementary imine‐bond and hydrogen‐bond networks, combining it with wood particles to fabricate the wood composite (WP/HTP) under mild hot‐pressing conditions. The WP/HTP exhibits 100% mechanical strength recovery after three cycles of reprocessing, and the reprocessed modulus of rupture (MOR) and modulus of
Xilin Zhang +9 more
wiley +1 more source
Star multigraphs with three vertices of maximum degree. [PDF]
, 1986 The graphs we consider here are either simple graphs, that is they have no loops or multiple edges, or are multigraphs, that is they may have more than one edge joining a pair of vertices, but again have no loops.
Hilton, A. J. W., Chetwynd, Amanda G.
core +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
On relationship between reformulated Sombor and other vertex--degree indices [PDF]
Let $G=(V,E)$, $V=\{v_1, v_2,\ldots,v_n\}$, $E=\{e_1, e_2,\ldots,e_m\}$, be a simple connected graph with $n\ge 2$ vertices and $m$ edges, with vertex degree sequence $\Delta=d_1\ge d_2\ge \cdots \ge d_n=\delta$, $ d_i=d(v_i)$, and edge degree sequence $\
Emina Milovanovic +4 more
core +2 more sources
, 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
Maximum vertex and face degree of oblique graphs
Discrete Mathematics, 2009 Let G = ( V , E , F ) be a 3-connected simple graph imbedded into a surface S with vertex set V, edge set E and face set F. A face α is an a1, a2, ... , ak-face if α is a k-gon and the degrees of the vertices incident with α in the cyclic order are a1, a2, ... , ak. The lexicographic minimum b1, b2, ... , bk such that α is a b1, b2, ...
Kardoš, František, Miškuf, Jozef
openaire +4 more sources
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