Results 121 to 130 of about 58,065 (305)
Decomposing dense bipartite graphs into 4-cycles
Let G be an even bipartite graph with partite sets X and Y such that |Y | is even and the minimum degree of a vertex in Y is at least 95|X|/96. Suppose furthermore that the number of edges in G is divisible by 4.
Nicholas J. Cavenagh +1 more
core
Stretchable and Strain‐Tolerant Gold‐Coated Fibrous Biosensor for Superoxide Anion Monitoring
A breathable, stretchable gold nanomesh–TPU fiber platform is developed via controlled electroless deposition, enabling uniform through‐thickness conductivity while preserving porosity. Functionalized with superoxide dismutase, the system achieves selective, real‐time electrochemical detection of superoxide with high sensitivity, mechanical durability,
Jafar M. Batayneh, Ahyeon Koh
wiley +1 more source
Graph decomposition and quasigroup identities
See directly the article.
Curt Lindner
doaj
Thickness‐Dependent Infrared Emissivity of Ultrathin Freestanding MoSiN Nanocomposite Membranes
ABSTRACT Metals and dielectrics show opposite trends in thickness‐dependent infrared emissivity: metallic films exhibit a rise in emissivity below a critical thickness, while dielectric films show a corresponding decline. For applications demanding both high emissivity and mechanical strength in membranes with nanoscale thickness, combining these ...
Reethu Sebastian +3 more
wiley +1 more source
Extremal problems on cycles, packing, and decomposition of graphs
In this thesis, we study extremal problems concerning cycles and paths in graphs, graph packing, and graph decomposition. We use “graph” in the general sense, allowing loops and multi-edges.
Wu, Hehui
core
Probing Near‐Field EM Fluctuations in Superparamagnetic CoFeB With NV Quantum Dephasometry
We non‐invasively investigate the superparamagnetic spin dynamics of a 1.1 nm CoFeB layer by probing its near‐field EM fluctuations using NV centers‐based quantum dephasometry. Our findings are further supported by theoretical modeling and SQUID‐based magnetization characterization. These results provide critical insight into the magnetization dynamics
Shoaib Mahmud +5 more
wiley +1 more source
Unavoidable parallel minors of regular matroids
This is the post-print version of the Article - Copyright @ 2011 ElsevierWe prove that, for each positive integer k, every sufficiently large 3-connected regular matroid has a parallel minor isomorphic to M (K_{3,k}), M(W_k), M(K_k), the cycle matroid of
Chun, Carolyn +5 more
core +1 more source
Formation Control of Multi‐Agent System with Local Interaction and Artificial Potential Field
This article proposes a local interaction‐based formation control method for Multi‐Agent system, integrating consensus and leader‐follower strategies with a stress response mechanism—artificial potential field to reduce communication overhead and enable obstacle avoidance. Experimental results on triangular, square, and hexagonal formations confirm its
Luoyin Zhao +3 more
wiley +1 more source
A path-decomposition of a graph is a partition of its edges into subgraphs each of which is a path or a union of paths (a linear forest). We survey known results when the graph and the linear forest are of prescribed types, and when the decomposition ...
Katherine Heinrich
doaj
Decomposition of hypercube graphs into paths and cycles having k edges
For an even graph G and positive integer p, q, and k, the pair (p, q) is an admissible pair if [Formula: see text]. If a graph G admits a decomposition into p copies of [Formula: see text], the path of length k, and q copies of Ck, the cycle of length k,
D. Saranya +3 more
doaj +1 more source

