Results 61 to 70 of about 16,549 (235)
Saturated Subgraphs of the Hypercube [PDF]
Combinatorics, Probability and Computing, 2016 We say a graph is (Qn,Qm)-saturatedif it is a maximalQm-free subgraph of then-dimensional hypercubeQn. A graph is said to be (Qn,Qm)-semi-saturatedif it is a subgraph ofQnand adding any edge forms a new copy ofQm. The minimum number of edges a (Qn,Qm)-saturated graph (respectively (Qn,Qm)-semi-saturated graph) can have is denoted by sat(Qn,Qm ...
Johnson, JR, Pinto, T
openaire +4 more sources
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
The $t/s$ -Diagnosability of Hypercube Networks Under the PMC and Comparison Models
IEEE Access, 2017 A t/s-diagnosable system, a generalization of t/t-diagnosable system, refers to such a system that all the faulty nodes of the system can be isolated within a set of size at most s in the presence of at most t faulty nodes.
Jiarong Liang, Qian Zhang
doaj +1 more source
Partitioning the hypercube into smaller hypercubes
Illinois Journal of MathematicsProofs slightly shortened and referee comments ...
Alon, Noga +2 more
openaire +3 more sources
Invariant Measure and Universality of the 2D Yang–Mills Langevin Dynamic
Communications on Pure and Applied Mathematics, EarlyView.ABSTRACT We prove that the Yang–Mills (YM) measure for the trivial principal bundle over the two‐dimensional torus, with any connected, compact structure group, is invariant for the associated renormalised Langevin dynamic. Our argument relies on a combination of regularity structures, lattice gauge‐fixing and Bourgain's method for invariant measures ...
Ilya Chevyrev, Hao Shen
wiley +1 more source
The line completion number of hypercubes
AKCE International Journal of Graphs and Combinatorics, 2019 In 1992, Bagga, Beineke, and Varma introduced the concept of the super line graph of index of a graph denoted by The vertices of are the -subsets of and two vertices and are adjacent if there exist and such that and are adjacent edges in They also ...
S.A. Tapadia, B.N. Waphare
doaj +2 more sources
Journal of Spectral Imaging, 2018 Nowadays, quality inspection of fruit and vegetables is typically accomplished through visual inspection. Automation of this inspection is desirable to make it more objective.
Jeroen van Roy +3 more
doaj +1 more source
Graphs and CombinatoricsAbstract A subset M of vertices in a graph G is a mutual-visibility set if any two vertices u and v in M “see” each
Maria Axenovich, Dingyuan Liu
openaire +2 more sources
Deep Underground Science and Engineering, EarlyView.This study investigates ground subsidence during tunnel excavation in karst areas, highlighting the combined effects of karst cave proximity, cave size, and soil spatial variability. Findings suggest that shorter cave distances and larger cave sizes increase subsidence variability, and a modified Peck formula is proposed for more accurate subsidence ...
Zhenghong Su +4 more
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