Results 161 to 170 of about 339,926 (334)
Through the application of Assur bar groups method and graph theory,the link classification and link composition are finished to get the most basic kinematic chain’s structure of the planar 3-DOF mechanism with full revolute pairs which has three ...
吴凡, 李瑞琴
doaj
Monotone Drawings of $k$-Inner Planar Graphs [PDF]
A $k$-inner planar graph is a planar graph that has a plane drawing with at most $k$ {internal vertices}, i.e., vertices that do not lie on the boundary of the outer face of its drawing. An outerplanar graph is a $0$-inner planar graph. In this paper, we show how to construct a monotone drawing of a $k$-inner planar graph on a $2(k+1)n \times 2(k+1)n ...
arxiv
This review synthesizes the evolution of radiative heat transfer, emphasizing the transition from far‐field to near‐field regimes. Traditional frameworks, such as Planck's law, are revisited alongside modern innovations like fluctuational electrodynamics. Applications span nanoscale thermal management, energy harvesting, and thermophotovoltaic systems.
Ambali Alade Odebowale+6 more
wiley +1 more source
Free Minor Closed Classes and the Kuratowski theorem [PDF]
Free-minor closed classes [2] and free-planar graphs [3] are considered. Versions of Kuratowski-like theorem for free-planar graphs and Kuratowski theorem for planar graphs are considered.
arxiv
Bi‐directionally assembled BN µ‐platelets in micropatterns formed by a micro‐molding method for thermal interface materials are demonstrated. The BN µ‐platelets are vertically aligned selectively, while compressed regions without patterns accommodate horizontally assembled BN µ‐platelets. Through anisotropic orientation, high thermal conductivities for
Young Gil Kim+12 more
wiley +1 more source
Cubic identity graphs and planar graphs derived from trees [PDF]
A. T. Balaban+4 more
openalex +1 more source
Gröbner Basis Convex Polytopes and Planar Graph [PDF]
Using the Gr\"obner basis of an ideal generated by a family of polynomials we prove that every planar graph is 4-colorable. Here we also use the fact that the complete graph of 5 vertices is not included in any planar graph.
arxiv
Biointerfacing with AgBiS2 Quantum Dots for Pseudocapacitive Photostimulation
It is demonstrated that AgBiS2 quantum dots exhibit unique photoinduced pseudocapacitive charge transfer properties, enabling efficient light‐to‐electrical energy conversion. These quantum dots facilitate enhanced light absorption and transduction when integrated with ZnO nanowires, which serve as an effective charge transport medium.
Ridvan Balamur+8 more
wiley +1 more source
AbstractIt is shown that every maximal planar graph (triangulation) can be contracted at an arbitrary point (by identifying it with an adjacent point) so that triangularity is preserved. This is used as a lemma to prove that every triangulation can be (a) oriented so that with three exceptions every point has indegree three, the exceptions having ...
openaire +2 more sources
A note on quasi-transitive graphs quasi-isometric to planar (Cayley) graphs [PDF]
Given a connected, locally finite, quasi-transitive graph $X$ which is quasi-isometric to a planar graph $\Gamma$, we remark that one can upgrade $\Gamma$ to be a planar Cayley graph, answering a question raised by Esperet--Giocanti and Hamann.
arxiv