Results 141 to 150 of about 1,379,637 (289)
Partitioning Planar Graphs Without Specific Cycles into a Forest and a Disjoint Union of Paths
In this paper, we show that if a planar graph G satisfies the following conditions: (i) none of its 3-faces is adjacent to a 6−-face, and (ii) none of its 4-faces is adjacent to a 5−-face, then V(G) can be partitioned into two subsets, each induces a ...
Pongpat Sittitrai+2 more
doaj +1 more source
This study examines the surface characteristics of AlInP (001), crucial for advanced solar cells and photoelectrochemical devices. Using theoretical modeling and experiments, it identifies how phosphorus‐rich and indium‐rich surfaces create mid‐gap states that pin the Fermi level and influence ultrafast electron dynamics.
Mohammad Amin Zare Pour+11 more
wiley +1 more source
Maximal planar graphs that embed as centers [PDF]
A maximal planar graph is a graph which can be embedded in the plane such that every face of the graph is a triangle. The center of a graph is the subgraph induced by the vertices of minimum eccentricity. We introduce the notion of quasi-eccentric vertices, and use this to characterize maximal planar graphs that are the center of some planar graph.
arxiv
A Homeostatic Photonic Device Integrating Vapor‐Regulated Thermo‐Optical Feedback Mechanisms
An inorganic homeostatic photonic device is designed to autonomously regulate light, temperature, and vapor sorption through integrated positive and negative feedback mechanisms at multiple wavelengths. The device uses a graded mesoporous 1D photonic crystal coupled with a photothermal layer.
Caroline Byun+4 more
wiley +1 more source
An algorithm for reliability analysis of planar graphs [PDF]
Daniel Blenstock
openalex +1 more source
Low‐dimensional halide perovskite thin films, (BA)2(MA)n‐1PbnBr3n+1 (n = 1, 2), exhibit both semiconducting and ferroelectric properties, enabling mechanical and light energy harvesting. Using Cr/Cr₂O₃ or PCBM as barrier layers ensures reproducible ferroelectricity.
Raja Sekhar Muddam+8 more
wiley +1 more source
Jones' conjecture for Halin graphs and a bit more [PDF]
We prove Jones' famous conjecture for Halin graphs and a somewhat more general class of graphs too. A based planar graph is a planar one that has a face adjacent to every other face. We confirm Jones' conjecture for based planar graphs. Namely, if a based planar graph does not contain $k+1$ vertex-disjoint cycles, then it suffices to delete $2k ...
arxiv
The orbital‐current‐induced torque is investigated as an efficient method for controlling magnetization direction. By introducing Ti as an orbital current source in Ti/Ta (or Pt)/CoFeB/MgO structures, the switching current is reduced by ∼25% compared to a conventional spin‐orbit torque structure of Ta/CoFeB/MgO.
So y. Shin+3 more
wiley +1 more source