Results 71 to 80 of about 3,139,455 (314)
A Note on Cycles in Locally Hamiltonian and Locally Hamilton-Connected Graphs
Let đ« be a property of a graph. A graph G is said to be locally đ«, if the subgraph induced by the open neighbourhood of every vertex in G has property đ«. RyjĂĄÄek conjectures that every connected, locally connected graph is weakly pancyclic.
Tang Long, Vumar Elkin
doaj +1 more source
Hamilton-connectedness and Hamilton-laceability of planar geometric graphs with applications
In this paper, we have used two different proof techniques to show the Hamilton-connectedness of graphs. By using the vertex connectivity and Hamiltoniancity of graphs, we construct an infinite family of Hamilton-connected convex polytope line graphs ...
Suliman Khan +4 more
doaj +1 more source
Limit cycle bifurcations of piecewise smooth near-Hamiltonian systems with a switching curve
This paper deals with the number of limit cycles for planar piecewise smooth near-Hamiltonian or near-integrable systems with a switching curve. The main task is to establish a so-called first order Melnikov function which plays a crucial role in the ...
Huanhuan Tian, Maoan Han
semanticscholar +1 more source
Spin Defects in Hexagonal Boron Nitride as 2D Strain Sensors
We demonstrate that boronâvacancy (VB${\rm V}_{\rm B}$) centers in hexagonal boron nitride (hBN) enable quantitative strain sensing with subâmicrometer resolution. Using this approach under continuously tunable inâplane stress, we precisely quantify strainâinduced shifts of the E2g${\rm E}_{2{\rm g}}$ Raman mode in multilayer hBN, establishing VB${\rm ...
Zhao Mu +7 more
wiley +1 more source
Strain Engineering of Magnetoresistance and Magnetic Anisotropy in CrSBr
Biaxial compressive strain significantly enhances magnetoresistance and critical saturation fields in thin flakes of the 2D magnet CrSBr, along all three crystallographic axes. Firstâprinciples calculations link these effects to strainâinduced increases in exchange interactions and magnetic anisotropy.
Eudomar HenrĂquezâGuerra +19 more
wiley +1 more source
Contractible Hamiltonian cycles in triangulated surfaces [PDF]
A triangulation of a surface is called $q$-equivelar if each of its vertices is incident with exactly $q$ triangles. In 1972 Altshuler had shown that an equivelar triangulation of torus has a Hamiltonian Circuit. Here we present a necessary and sufficient condition for existence of a contractible Hamiltonian Cycle in equivelar triangulation of a ...
openaire +3 more sources
AIâAssisted Workflow for (Scanning) Transmission Electron Microscopy: From Data Analysis Automation to Materials Knowledge Unveiling. Abstract (Scanning) transmission electron microscopy ((S)TEM) has significantly advanced materials science but faces challenges in correlating precise atomic structure information with the functional properties of ...
Marc Botifoll +19 more
wiley +1 more source
Hamiltonian cycle clustering with asymmetric correlation
Analysts who explore high-dimensional data usually want three answers at once: Which samples belong together, how close the resulting groups are, and who influences whom accordingly.
Tianyi Huang +2 more
doaj +1 more source
Spin and Charge Control of Topological End States in Chiral Graphene Nanoribbons on a 2D Ferromagnet
Chiral graphene nanoribbons on a ferromagnetic gadoliniumâgold surface alloy display tunable spin and charge states at their termini. Atomic work function variations and exchange fields enabe transitions between singlet, doublet, and triplet configurations.
Leonard Edens +8 more
wiley +1 more source
On the Hamiltonian Number of a Plane Graph
The Hamiltonian number of a connected graph is the minimum of the lengths of the closed spanning walks in the graph. In 1968, Grinberg published a necessary condition for the existence of a Hamiltonian cycle in a plane graph, formulated in terms of the ...
Lewis Thomas M.
doaj +1 more source

