Results 121 to 130 of about 4,115 (305)
Advanced Materials, EarlyView.Metasurface‐engineered NC‐TENG arrays integrate tactile pressure mapping, non‐contact gesture sensing, and acoustic signal readouts in one ultrathin module, and outperforms pristine PDMS in terms of electrical output and real‐time spatial mapping for next‐gen wearables.
Injamamul Arief +12 more
wiley +1 more source
On the nontrivial extremal eigenvalues of graphs
Discrete MathematicsWe present a finer quantitative version of an observation due to Breuillard, Green, Guralnick and Tao which tells that for finite non-bipartite Cayley graphs, once the nontrivial eigenvalues of their normalized adjacency matrices are uniformly bounded away from $1$, then they are also uniformly bounded away from $-1$. Unlike previous works which depend
Wenbo Li, Shiping Liu
openaire +2 more sources
On Extremal Graphs with Bounded Girth
Electronic Notes in Discrete Mathematics, 2009 Abstract By the extremal number ex ( n ; t ) = ex ( n ; { C 3 , C 4 , … , C t } ) we denote the maximum size (number of edges) in a graph of n vertices, n > t , and girth (length of shortest cycle) at least g ⩾ t + 1 .
Charles Delorme +4 more
openaire +1 more source
Advanced Materials, EarlyView.Mechanically origami‐coded 3D kirigami photovoltaics convert a single extension–release cycle into deterministic self‐folding, reconfiguring planar solar cells into programmable 3D modules. Distinct coding strategies enable either ultrahigh stretchability (500% system strain) or ultrahigh initial effective areal coverage (225%).
Seok Joon Hwang +15 more
wiley +1 more source
On the extreme eigenvalues of regular graphs
Journal of Combinatorial Theory, Series B, 2006 accepted to J.Combin.Theory, Series B.
openaire +3 more sources
Motivating Generalized Extremal Problems
, 2023 In this talk, we discuss the history of extremal graph theory, in particular motivating several generalizations of classical extremal questions which have become popular in recent years.
Halfpap, Anna
core
Advanced Materials, EarlyView.We introduce a computational workflow that combines quantum chemical calculations and machine learning techniques to predict the catalytic performance of a wide range of catalysts in the nitrogen reduction reaction (NRR). The analysis of the trained models provides insights into the complex structure–activity relationship in experimental catalytic ...
Leonardo Di Ciano +5 more
wiley +1 more source
Extremal graphs for the odd prism
Discrete MathematicsThe Turán number $\mathrm{ex}(n,H)$ of a graph $H$ is the maximum number of edges in an $n$-vertex graph which does not contain $H$ as a subgraph. The Turán number of regular polyhedrons was widely studied in a series of works due to Simonovits. In this paper, we shall present the exact Turán number of the prism $C_{2k+1}^{\square} $, which is defined ...
Xiaocong He, Yongtao Li, Lihua Feng
openaire +3 more sources
Near‐Unity Chiral Lasing Enabled by Quasi‐Bound States in the Continuum
Advanced Materials, EarlyView.Nanoimprinted chiral array that supports bound states in the continuum is doped with an efficient non‐chiral molecule (Rhodamine‐B) acting as gain medium to produce fully circularly polarized lasing emission. The chiral lasing wavelength can be tuned across the emission band of Rhodamine‐B by adjusting the coating thickness of the TiO2 high refractive ...
Jose Mendoza‐Carreño +5 more
wiley +1 more source
Extremal Topological Indices with Prescribed Degree Sequences
Vestnik KRAUNC: Fiziko-Matematičeskie NaukiThis paper explores the extremal properties and bounds of two significant topological indices in graph theory: the Albertson and Sigma indices, with an emphasis on trees and bipartite graphs.
Hamoud, J., Belov, A.Ya.
doaj +1 more source