SearcharxivSearch

arXiv subjects

Yeonhee Lee

Publications and source records attributed to Yeonhee Lee.

2 recordsLinked to original sources

Morphology and depletion force-based large-scale self-assembly of nanocubes on surface

Self-assembling nanoparticles is a highly efficient and facile way to form functional nano-, micro- and macrostructures. However, currently available methods lack precision and controllability in size, shape and composition, suffer from poor reproducibility and scalability, and require complex steps and expensive materials. Here, we present the uniform morphology-induced and depletion force-directed nanoparticle assembly on surface (MIDAS) method with gold nanocubes (AuNCs). Using this approach, morphology-sensitive depletion forces trigger shape-selective flocculation and assembly of the AuNCs with uniform size and shape. Importantly, the surface roughness-controlled substrate drives the large-scale formation of AuNC-assembled monolayers (2D AuNAMs) or three-dimensional AuNC-assembled multilayers (3D AuNAMs) in a highly specific manner without any complex ligand modification or preparation steps. Lattice-gas modeling and kinetic Monte Carlo simulations show the depletion force is the key parameter determining supercrystal morphology and corroborate the experimental findings. This work establishes a generalizable nanoparticle assembly mechanism and demonstrates the broad applicability of the MIDAS strategy for scalable fabrication and patterning of 2D and 3D nanoparticle architectures.

cond-mat.mtrl-sci

A proper total coloring distinguishing adjacent vertices by sums of some product graphs

In this article, we consider a proper total coloring distinguishes adjacent vertices by sums, if every two adjacent vertices have different total sum of colors of the edges incident to the vertex and the color of the vertex. Pilsniak and Wozniak \cite{PW} first introduced this coloring and made a conjecture that the minimal number of colors need to have a proper total coloring distinguishes adjacent vertices by sums is less than or equal to the maximum degree plus $3$. We study proper total colorings distinguishing adjacent vertices by sums of some graphs and their products. We find that these graphs satisfy the conjecture.

math.CO