Results 71 to 80 of about 34,294 (314)
An entropy‐tuned niobium‐based oxide (ETNO) anode for fast‐charging lithium‐ion batteries are presented, engineered via multi‐cation doping. The synergistic effects of entropy tuning result in excellent rate capability and long‐term durability under ultrafast charging conditions.
Yoojin Ahn +6 more
wiley +1 more source
Design and Applications of Multi‐Frequency Programmable Metamaterials for Adaptive Stealth
This article provides a comprehensive overview of metamaterials, including their fundamental principles, properties, synthesis techniques, and applications in stealth, as well as their challenges and future prospects. It covers topics that are more advanced than those typically discussed in existing review articles, while still being closely connected ...
Jonathan Tersur Orasugh +4 more
wiley +1 more source
Spectral analysis connects graph structure to the eigenvalues and eigenvectors of associated matrices. Much of spectral graph theory descends directly from spectral geometry, the study of differentiable manifolds through the spectra of associated ...
Benson, Austin R. +2 more
core +1 more source
This review explores functional and responsive materials for triboelectric nanogenerators (TENGs) in sustainable smart agriculture. It examines how particulate contamination and dirt affect charge transfer and efficiency. Environmental challenges and strategies to enhance durability and responsiveness are outlined, including active functional layers ...
Rafael R. A. Silva +9 more
wiley +1 more source
A Survey of Maximal k-Degenerate Graphs and k-Trees
This article surveys results on maximal $k$-degenerate graphs, $k$-trees, and related classes including simple $k$-trees, $k$-paths, maximal outerplanar graphs, and Apollonian networks.
Allan Bickle
doaj +1 more source
Some New Bounds for α-Adjacency Energy of Graphs
Let G be a graph with the adjacency matrix A(G), and let D(G) be the diagonal matrix of the degrees of G. Nikiforov first defined the matrix Aα(G) as Aα(G)=αD(G)+(1−α)A(G), 0≤α≤1, which shed new light on A(G) and Q(G)=D(G)+A(G), and yielded some ...
Haixia Zhang, Zhuolin Zhang
doaj +1 more source
On two problems in Ramsey-Tur\'an theory
Alon, Balogh, Keevash and Sudakov proved that the $(k-1)$-partite Tur\'an graph maximizes the number of distinct $r$-edge-colorings with no monochromatic $K_k$ for all fixed $k$ and $r=2,3$, among all $n$-vertex graphs.
Balogh, József +2 more
core +1 more source
MOFs and COFs in Electronics: Bridging the Gap between Intrinsic Properties and Measured Performance
Metal‐organic frameworks (MOFs) and covalent organic frameworks (COFs) hold promise for advanced electronics. However, discrepancies in reported electrical conductivities highlight the importance of measurement methodologies. This review explores intrinsic charge transport mechanisms and extrinsic factors influencing performance, and critically ...
Jonas F. Pöhls, R. Thomas Weitz
wiley +1 more source
Graph-Theoretic Approach for Self-Testing in Bell Scenarios
Self-testing is a technology to certify states and measurements using only the statistics of the experiment. Self-testing is possible if some extremal points in the set B_{Q} of quantum correlations for a Bell experiment are achieved, up to isometries ...
Kishor Bharti +5 more
doaj +1 more source
Tur\'{a}n's theorem is a cornerstone of extremal graph theory. It asserts that for any integer $r \geq 2$ every graph on $n$ vertices with more than ${\tfrac{r-2}{2(r-1)}\cdot n^2}$ edges contains a clique of size $r$, i.e., $r$ mutually adjacent ...
Reiher, Christian
core +1 more source

