Results 41 to 50 of about 24,777 (243)
Matchings Extend to Hamiltonian Cycles in 5-Cube
Discussiones Mathematicae Graph Theory, 2018 Ruskey and Savage asked the following question: Does every matching in a hypercube Qn for n ≥ 2 extend to a Hamiltonian cycle of Qn? Fink confirmed that every perfect matching can be extended to a Hamiltonian cycle of Qn, thus solved Kreweras’ conjecture.
Wang Fan, Zhao Weisheng
doaj +1 more source
Advanced Intelligent Discovery, EarlyView.Heat generation in lithium‐ion batteries affects performance, aging, and safety, requiring accurate thermal modeling. Traditional methods face efficiency and adaptability challenges. This article reviews machine learning‐based and hybrid modeling approaches, integrating data and physics to improve parameter estimation and temperature prediction ...
Qi Lin +4 more
wiley +1 more source
Characterizing which Powers of Hypercubes and Folded Hyper- cubes Are Divisor Graphs
Discussiones Mathematicae Graph Theory, 2015 In this paper, we show that Qkn is a divisor graph, for n = 2, 3. For n ≥ 4, we show that Qkn is a divisor graph iff k ≥ n − 1. For folded-hypercube, we get FQn is a divisor graph when n is odd.
AbuHijleh Eman A. +2 more
doaj +1 more source
On the maximal connected component of a hypercube with faulty vertices III
, 2006 Hypercube is one of the most popular topologies for connecting processors in multicomputer systems. In this paper we address the maximum order of a connected component in a faulty cube. The results established include several known conclusions as special
Yang, X. +3 more
core +1 more source
Advanced Intelligent Systems, EarlyView.An integrated OT‐2/plate reader platform automates LCST cloud point measurement of NIPAM‐co‐DMAEMA copolymers across high‐dimensional formulation spaces. Machine learning trained on the resulting high‐throughput datasets achieves R2 up to 0.96 and enables inverse design of polymer formulations to target transition temperatures with <1% error.
Lachlan Alexander +2 more
wiley +1 more source
Distance Magic Cartesian Products of Graphs
Discussiones Mathematicae Graph Theory, 2016 A distance magic labeling of a graph G = (V,E) with |V | = n is a bijection ℓ : V → {1, . . . , n} such that the weight of every vertex v, computed as the sum of the labels on the vertices in the open neighborhood of v, is a constant.
Cichacz Sylwia +3 more
doaj +1 more source
The Capture Time of the Hypercube [PDF]
The Electronic Journal of Combinatorics, 2013 In the game of Cops and Robbers, the capture time of a graph is the minimum number of moves needed by the cops to capture the robber, assuming optimal play. We prove that the capture time of the $n$-dimensional hypercube is $\Theta (n\ln n)$. Our methods include a novel randomized strategy for the players, which involves the analysis of the coupon ...
Anthony Bonato +3 more
openaire +5 more sources
Business Strategy and the Environment, EarlyView.ABSTRACT This research develops an integrated mixed‐integer linear programming (MILP) model for closed‐loop supply chain network design that optimises competing economic and environmental objectives including profit maximisation, supplier quality improvement and CO2 emission reduction.
Reza Eslamipoor
wiley +1 more source
The Path-Distance-Width of Hypercubes
Discussiones Mathematicae Graph Theory, 2013 The path-distance-width of a connected graph G is the minimum integer w satisfying that there is a nonempty subset of S ⊆ V (G) such that the number of the vertices with distance i from S is at most w for any nonnegative integer i.
Otachi Yota
doaj +1 more source
Dynamic Calibration of DEM Simulations Using Rotating Drum Experiments Using the Mean Absolute Error
Chemie Ingenieur Technik, EarlyView.Calibrating DEM simulations is challenging due to unknown microscopic parameters. Rotating drum experiments are combined with image‐based analysis and Latin Hypercube Sampling (LHS). An area‐based Mean Absolute Error (MAE) enables reliable identification of optimal parameter sets.
Marius Hoffmann +2 more
wiley +1 more source