Results 111 to 120 of about 76,992 (320)
Hamiltonian Cycles in the Square of a Graph [PDF]
The Electronic Journal of Combinatorics, 2011 We show that under certain conditions the square of the graph obtained by identifying a vertex in two graphs with hamiltonian square is also hamiltonian. Using this result, we prove necessary and sufficient conditions for hamiltonicity of the square of a connected graph such that every vertex of degree at least three in a block graph corresponds to a
openaire +3 more sources
Advanced Science, EarlyView.The external field exceeds Hd, the speed polarization abruptly reorients to align with the Mn magnetic moments, leading to an MR ≈ −100%. Abstract Mn3Si2Te6, quasi‐2D ferrimagnetic semiconductor, exhibits anomalous saturated colossal magnetoresistance (CMR) only when a magnetic field is applied along its magnetic hard magnetization axis, suggesting ...
Shiqi Li +10 more
wiley +1 more source
The Hamiltonian and Hypohamiltonian of Generalized Petersen Graph (GP_(n,9))
Jambura Journal of MathematicsThe study of Hamiltonian and Hypohamiltonian properties in the generalized Petersen graph GP_{n,k} is interesting due to the unique structure and characteristics of these graphs. The method employed in this study involves searching for Hamiltonian cycles
Susilawati Susilawati +3 more
doaj +1 more source
Advanced Electronic Materials, EarlyView.The use of air stable but thermally labile molecules provides an efficient strategy for the N‐type doping of organic semiconductors with relatively low electron affinities. Design criteria for efficient dopants should also take into account diffusion and phase segregation that cannot be decoupled from thermally activated doping.
Francesca Pallini +15 more
wiley +1 more source
Hamiltonian cycles in skirted trees [PDF]
, 1987 Mirostawa Skowrońska, M. M. Sysło
openalex +1 more source
On pre-Hamiltonian Cycles in Hamiltonian Digraphs
, 2014 Let $D$ be a strongly connected directed graph of order $n\geq 4$. In \cite{[14]} (J. of Graph Theory, Vol.16, No. 5, 51-59, 1992) Y. Manoussakis proved the following theorem: Suppose that $D$ satisfies the following condition for every triple $x,y,z$ of vertices such that $x$ and $y$ are non-adjacent: If there is no arc from $x$ to $z$, then $d(x)+d(y)
openaire +2 more sources
Multiferroicity in Calcium Manganate via Strain Engineering
Advanced Electronic Materials, EarlyView.Multiferroicity is achieved in the non‐ferroelectric magnet calcium manganate through tensile‐strain engineering. The ferroelectricity below 45 K is evidenced by the polarization‐electric field hysteresis loops, and the magnetization below 125 K is confirmed by the magnetization measurements.
Ye Yuan +10 more
wiley +1 more source
Energy Conditions for Hamiltonicity of Graphs
Discrete Dynamics in Nature and Society, 2014 Let G be an undirected simple graph of order n. Let A(G) be the adjacency matrix of G, and let μ1(G)≤μ2(G)≤⋯≤μn(G) be its eigenvalues. The energy of G is defined as ℰ(G)=∑i=1n|μi(G)|. Denote by GBPT a bipartite graph.
Guidong Yu +3 more
doaj +1 more source
A matching and a Hamiltonian cycle of the fourth power of a connected graph [PDF]
, 1993 Ladislav Nebeský
openalex +1 more source
Atomistic Modeling of Valence Change Memory Devices: What Can We Learn from Simulations?
Advanced Electronic Materials, EarlyView.Simulation of resistive switching in valence change memory cells tusing density functional theory (DFT), molecular dynamics (MD), nudged elastic band (NEB), kinetic Monte Carlo (KMC), and quantum transport (QT) methods. Abstract Resistive switching devices based on the valence change effect have shown promise for applications in emerging in‐memory and ...
Marko Mladenović, Mathieu Luisier
wiley +1 more source