Results 81 to 90 of about 311 (214)

Hamiltonian cycles in I–graphs

Electronic Notes in Discrete Mathematics, 2013
Abstract The I–graphs generalize the family of generalized Petersen graphs. We show that a connected I–graph which is not a generalized Petersen graph is Hamiltonian.
BONVICINI, Simona, Pisanski, Tomaž
openaire   +2 more sources

Multiferroic‐Centric Materials and Systems Engineering for Battery Applications: An Insight Into Mechanisms, Strategies, and Characterizations

Advanced Science, EarlyView.
Multiferroic order parameters – polarization, magnetization, and ferroelastic strain – are positioned as dynamic design variables for batteries. Their mechanistic roles, practical tuning through fabrication and external fields, and ferroic‐resolved characterization routes are unified into a closed‐loop framework, revealing how coupled ferroic responses
Jiaqi Su, Yanda Zhu, Hao Peng, Manman Li, Xuzihan Zhang, Meixiao Wu, Siyuan Zhang, Yuhan Zeng, Jiwen Liao, Ming Luo, Hetaishan Huang, Yutong Wang, Sean Li, Wenxian Li   +13 more
wiley   +1 more source

An exciting Approach to Theoretical Spectroscopy

Advanced Science, EarlyView.
ABSTRACT Theoretical spectroscopy, and more generally, electronic‐structure theory, are powerful concepts for describing the complex many‐body interactions in materials. They cover methods from ground‐state properties to lattice excitations and light‐matter interaction, including time‐resolved variants.
Martí Raya‐Moreno, Alexander Buccheri, Noah Alexy Dasch, Nasrin Farahani, Ignacio Gonzalez Oliva, Andris Gulans, Seokhyun Hong, Manoar Hossain, Hannah Kleine, Martin Kuban, Sven Lubeck, Benedikt Maurer, Pasquale Pavone, Fabian Peschel, Daria Popova‐Gorelova, Lu Qiao, Elias Richter, Santiago Rigamonti, Ronaldo Rodrigues Pela, Maximilian Schebek, Kshitij Sinha, Daniel T. Speckhard, Jan Stutz, Sebastian Tillack, Dmitry Tumakov, Jānis Užulis, Mara Voiculescu, Cecilia Vona, Mao Yang, Claudia Draxl   +29 more
wiley   +1 more source

An Implicit Weighted Degree Condition For Heavy Cycles

Discussiones Mathematicae Graph Theory, 2014
For a vertex v in a weighted graph G, idw(v) denotes the implicit weighted degree of v. In this paper, we obtain the following result: Let G be a 2-connected weighted graph which satisfies the following conditions: (a) The implicit weighted degree sum of
Cai Junqing, Li Hao, Ning Wantao
doaj   +1 more source

Polarization Dynamics in Ferroelectrics: Insights Enabled by Machine Learning Molecular Dynamics

Advanced Science, EarlyView.
Machine learning molecular dynamics is presented as a route to capture polarization switching, domain wall kinetics, topological polar textures, and polar mechanical coupling beyond the limits of conventional atomistic methods. This Perspective surveys recent progress and identifies key methodological directions, including long‐range electrostatics ...
Dongyu Bai, Ri He, Junxian Liu, Liangzhi Kou   +3 more
wiley   +1 more source

Multicolored parallelisms of Hamiltonian cycles

Discrete Mathematics, 2009
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Hung-Lin Fu, Yuan-Hsun Lo
openaire   +2 more sources

Emergent 3D Fermiology and Magnetism in an Intercalated Van der Waals System

Advanced Science, EarlyView.
An emergent three‐dimensional electronic state is uncovered in an intercalated van der Waals system. A spin‐polarized intercalant‐host hybridized band crossing the Fermi level provides an itinerant channel for interlayer exchange, highlighting how electronic dispersion governs magnetic dimensionality.
Luigi Camerano, Emanuel A. Martínez, Victor Porée, Laura Martella, Dario Mastrippolito, Debora Pierucci, Franco D'Orazio, Polina M. Sheverdyaeva, Paolo Moras, Enrico Della Valle, Tianlun Yu, Moritz Hoesch, Craig M. Polley, Thiagarajan Balasubramanian, Alessandro Nicolaou, Luca Ottaviano, Vladimir N. Strocov, Gianni Profeta, Federico Bisti   +18 more
wiley   +1 more source

A note on edge-disjoint contractible Hamiltonian cycles in polyhedral maps

Electronic Journal of Graph Theory and Applications, 2014
We present a necessary and sufficient condition for existence of edge-disjoint contractible Hamiltonian Cycles in the edge graph of polyhedral maps.
Ashish K Upadhyay, Dipendu Maity
doaj   +1 more source

The S-Hamiltonian Cycle Problem

CoRR
Determining if an input undirected graph is Hamiltonian, i.e., if it has a cycle that visits every vertex exactly once, is one of the most famous NP-complete problems. We consider the following generalization of Hamiltonian cycles: for a fixed set $S$ of natural numbers, we want to visit each vertex of a graph $G$ exactly once and ensure that any two ...
Antoine Amarilli, Arthur Lombardo, Mikaël Monet   +2 more
openaire   +2 more sources

QAOA on Hamiltonian Cycle problem

CoRR, 2023
I use QAOA to solve the Hamiltonian Circle problem. First, inspired by Lucas, I define the QUBO form of Hamiltonian Cycle and transform it to a quantum circuit by embedding the problem of $n$ vertices to an encoding of $(n-1)^2$ qubits. Then, I calcluate the spectrum of the cost hamiltonian for both triangle case and square case and justify my ...
openaire   +2 more sources