Results 91 to 100 of about 34,901 (303)
Schematic illustration of a sustainable nanofabrication process: chitosan derived from natural sources is used as a biodegradable thin film resist, patterned via Constant Pulse‐Assisted Force Lithography (CP‐AFL) to create tunable nanogrooves. These grooves template gold nanowire formation, enabling high‐resolution nanopatterning under ambient ...
Paolo Pellegrino +7 more
wiley +1 more source
Induced cycles in triangle graphs
The triangle graph of a graph $G$, denoted by ${\cal T}(G)$, is the graph whose vertices represent the triangles ($K_3$ subgraphs) of $G$, and two vertices of ${\cal T}(G)$ are adjacent if and only if the corresponding triangles share an edge. In this paper, we characterize graphs whose triangle graph is a cycle and then extend the result to obtain a ...
S. Aparna Lakshmanan +2 more
openaire +4 more sources
Xenes for Sustainable Energy: A Roadmap From First‐Principles Design to Practical Deployment
Emerging 2D Xenes are advancing from theoretical predictions toward practical energy‐storage and conversion technologies through the integration of first‐principles modelling, experimental synthesis, electrochemical validation, and AI‐assisted materials design, enabling accelerated discovery of high‐performance and sustainable electrochemical systems ...
Onur Karaman, Ceren Karaman
wiley +1 more source
Triangle‐factors in pseudorandom graphs [PDF]
We show that if the second eigenvalue $λ$ of a $d$-regular graph $G$ on $n \in 3 \mathbb{Z}$ vertices is at most $\varepsilon d^2/(n \log n)$, for a small constant $\varepsilon > 0$, then $G$ contains a triangle-factor. The bound on $λ$ is at most an $O(\log n)$ factor away from the best possible one: Krivelevich, Sudakov and Szabó, extending a ...
openaire +3 more sources
Random triangles in random graphs
AbstractIn a recent paper, Oliver Riordan shows that for and p up to and slightly larger than the threshold for a Kr‐factor, the hypergraph formed by the copies of Kr in G(n, p) contains a copy of the binomial random hypergraph with . For r = 3, he gives a slightly weaker result where the density in the random hypergraph is reduced by a constant ...
openaire +3 more sources
11/4-colorability of subcubic triangle-free graphs
We prove that up to two exceptions, every connected subcubic triangle-free graph has fractional chromatic number at most 11/4. This is tight unless further exceptional graphs are excluded, and improves the known bound on the fractional chromatic number ...
Lidicky, Bernard +2 more
core
Mesenchymal stem cell derived extracellular vesicles (MSC‐EVs) are a promising therapeutic tool for regenerative medicine. However, the field lacks a reproducible high‐yield production method to answer the quantities needed for clinical translation.
Christophe Wong +7 more
wiley +1 more source
The median of Sierpiński triangle graphs
The median $M$ of a graph $G$ is the set of vertices with a minimum total distance to all other vertices in the graph. In this paper, we determine the median of Sierpiński triangle graphs. Sierpiński triangle graphs, also known as Sierpiński gasket graphs of order $n$ are graphs formed by contracting all non-clique edges from the Sierpiński graphs of ...
Kannan Balakrishnan +5 more
openaire +2 more sources
Strongly-Connected Outerplanar Graphs with Proper Touching Triangle Representations
A proper touching triangle representation R of an n-vertex planar graph consists of a triangle divided into n non-overlapping triangles. A pair of triangles are considered to be adjacent if they share a partial side of positive length. Each triangle in R
Fowler, J. Joseph, J. Joseph Fowler
core +1 more source
This review explores advances in wearable and lab‐on‐chip technologies for breast cancer detection. Covering tactile, thermal, ultrasound, microwave, electrical impedance tomography, electrochemical, microelectromechanical, and optical systems, it highlights innovations in flexible electronics, nanomaterials, and machine learning.
Neshika Wijewardhane +4 more
wiley +1 more source

