Results 111 to 120 of about 77,685 (270)
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
Advanced Intelligent Discovery, EarlyView.The authors evaluated six machine‐learned interatomic potentials for simulating threshold displacement energies and tritium diffusion in LiAlO2 essential for tritium production. Trained on the same density functional theory data and benchmarked against traditional models for accuracy, stability, displacement energies, and cost, Moment Tensor Potential ...
Ankit Roy +8 more
wiley +1 more source
Advanced Intelligent Discovery, EarlyView.Factorization machine with iterative quantum reverse annealing (FMIRA) leverages quantum reverse annealing to perform batch black‐box optimization. Factorization machine with quantum annealing (FMQA) is a widely used python package for solving black‐box optimization problems using D‐Wave quantum annealers.
Andrejs Tučs, Ryo Tamura, Koji Tsuda
wiley +1 more source
On edge-graceful labeling and deficiency for regular graphs
AKCE International Journal of Graphs and Combinatorics, 2018 An edge-graceful labeling of a finite simple graph with vertices and edges is a bijection from the set of edges to the set of integers such that the vertex sums are pairwise distinct modulo , where the vertex sum at a vertex is the sum of labels of all ...
Tao-Ming Wang, Guang-Hui Zhang
doaj +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
Advanced Intelligent Systems, EarlyView.This paper proposes a novel control framework to ensure safety of a robotic swarm. A feedback optimization controller is capable of driving the swarm toward a target density while keeping risk‐zone exposure below a safety threshold. Theory and experiments show how safety is more effectively achieved for sparsely connected swarms.
Longchen Niu, Gennaro Notomista
wiley +1 more source
Advanced Intelligent Systems, EarlyView.This study refines the Crystal Hamiltonian Graph Network to predict energies, structures, and lithium‐ion dynamics in halide electrolytes. By generating ordered structural models and using an iterative fine‐tuning workflow, we achieve near‐ab initio accuracy for phase stability and ionic transport predictions.
Jonas Böhm, Aurélie Champagne
wiley +1 more source
Intuitionistic Fuzzy Hamiltonian Cycle by Index Matrices [PDF]
Annals of computer science and information systems, 2020 Velichka Traneva, Stoyan Tranev
doaj +1 more source
Advanced Intelligent Systems, EarlyView.A hybrid quantum‐classical architecture is introduced to accurately identify dynamical quantum phase transitions from time‐evolved quantum states. The QCNN serves as a quantum dynamical feature extractor, while the classical network learns temporal correlations from a low‐dimensional readout sequence. The framework attains high accuracy, remains robust
Daili Li +3 more
wiley +1 more source
Exploiting Ferroelectric and Spintronic Dynamics for Neural Network Computation
Advanced Intelligent Systems, EarlyView.Ferroelectric and spintronic devices, relying on the control of polarization and magnetization, offer intrinsically fast, durable, energy‐efficient, and low‐latency building blocks for analog in‐memory computing. The hysteretic dynamics of an order parameter are leveraged to provide nonvolatile, multistate memory and nonlinear switching. Brain‐inspired
Dashiell Harrison +4 more
wiley +1 more source