Results 71 to 80 of about 2,715 (247)
AI‐Assisted Workflow for (Scanning) Transmission Electron Microscopy: From Data Analysis Automation to Materials Knowledge Unveiling. Abstract (Scanning) transmission electron microscopy ((S)TEM) has significantly advanced materials science but faces challenges in correlating precise atomic structure information with the functional properties of ...
Marc Botifoll +19 more
wiley +1 more source
ABSTRACTIt is well‐known that Brualdi‐Hoffman‐Turán‐type problem inquiries about the maximum spectral radius of an ‐free graph with edges. This can be regarded as a spectral characterization of the existence of the subgraph within . A significant contribution to this problem was made by Nikiforov (2002).
Shuchao Li, Sishu Zhao, Lantao Zou
openaire +2 more sources
Metal‐free carbon catalysts enable the sustainable synthesis of hydrogen peroxide via two‐electron oxygen reduction; however, active site complexity continues to hinder reliable interpretation. This review critiques correlation‐based approaches and highlights the importance of orthogonal experimental designs, standardized catalyst passports ...
Dayu Zhu +3 more
wiley +1 more source
Edge δ− Graceful Labeling for Some Cyclic-Related Graphs
In this paper, we introduce a new type of labeling of a graph G with p vertices and q edges called edge δ− graceful labeling, for any positive integer δ, as a bijective mapping f of the edge set EG into the set δ,2δ,3δ,⋯,qδ such that the induced mapping ...
Mohamed R. Zeen El Deen
doaj +1 more source
Energetic Offset in Organic Solar Cells‐ Importance, Confusion and Outlook
Energetic offsets in organic solar cells (OSCs) remain a subject of debate due to measurement‐ and lab‐dependent discrepancies. This Perspective clarifies the physical origins of these variations and identifies temperature‐dependent electro‐optical methods as a reliable approach to obtain consistent offset values.
Nakul Jain +5 more
wiley +1 more source
Path Energy Bounds For Hub-Centric Graphs Of Order 2n+1 With Algorithmic Computation
This study investigates the path energy bounds of hub-centric graph families of order (2n+1), denoted by ℋ_{2n+1}. The path energy is defined as the absolute sum of the eigenvalues of the path adjacency matrix A_p(ℋ_{2n+1}), where each entry p_{ij ...
R. Jerlinkasmir +3 more
doaj +1 more source
Some New Topological Indices of Friendship Graph
Abstract: In this paper we compute the first and second Kulli-Basava indices, hyper Kulli-Basava indices, some connectivity Kulli-Basava indices, geometric-arithmetic Kulli-Basava indices and reciprocal Kulli-Basava indices of the friendship graph.
openaire +1 more source
We demonstrate a neuromorphic synapse in 2D Fe3GaTe2 flakes. The device operates via a current‐driven transformation from a skyrmion‐lattice to a stripe‐domain state, yielding a linear anomalous Hall resistance response with a tunable slope to enable multiply‐accumulate operations. Simulations confirm its viability in artificial neural networks.
Jixiang Huang +20 more
wiley +1 more source
Brouwer's conjecture for the sum of the k largest Laplacian eigenvalues of some graphs
Let GG be a graph with n(G)n\left(G) vertices and e(G)e\left(G) edges, and Sk(G){S}_{k}\left(G) be the sum of the kk largest Laplacian eigenvalues of GG. Brouwer conjectured that Sk(G)≤e(G)+k+12{S}_{k}\left(G)\le e\left(G)+\left(\phantom{\rule[-0.75em]{}{
Wang Ke +3 more
doaj +1 more source
Graphic sequences with a realization containing a generalized friendship graph
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Jian-Hua Yin, Gang Chen, John R. Schmitt
openaire +1 more source

