Results 81 to 90 of about 16,549 (235)
Sensitivity and Hamming Graphs
Journal of Graph Theory, EarlyView.ABSTRACT For any m ≥ 3 $m\ge 3$ we show that the Hamming graph H ( n , m ) $H(n,m)$ admits an imbalanced partition into m $m$ sets, each inducing a subgraph of low maximum degree. This improves previous results by Tandya and by Potechin and Tsang, and disproves the Strong m $m$‐ary Sensitivity Conjecture of Asensio, García‐Marco, and Knauer.
Sara Asensio +3 more
wiley +1 more source
Tight Bounds for Hypercube Minor‐Universality
Journal of Graph Theory, EarlyView.ABSTRACT A graph G $G$ is m $m$‐minor‐universal if every graph H $H$ with at most m $m$ edges and no isolated vertices is contained as a minor in G $G$. Recently, Benjamini, Kalifa and Tzalik proved that there is an absolute constant c>0 $c\gt 0$ such that the d $d$‐dimensional hypercube Qd ${Q}_{d}$ is (c⋅2d/d $c\cdot {2}^{d}/d$)‐minor‐universal ...
Emma Hogan +5 more
wiley +1 more source
Structure fault tolerance of hypercubes and folded hypercubes
Theoretical Computer Science, 2018 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Eminjan Sabir, Jixiang Meng
openaire +1 more source
Signed Projective Cubes, a Homomorphism Point of View
Journal of Graph Theory, EarlyView.ABSTRACT The (signed) projective cubes, as a special class of graphs closely related to the hypercubes, are on the crossroad of geometry, algebra, discrete mathematics and linear algebra. Defined as Cayley graphs on binary groups, they represent basic linear dependencies.
Meirun Chen +2 more
wiley +1 more source
Fractional List Packing for Layered Graphs
Journal of Graph Theory, EarlyView.ABSTRACT The fractional list packing number χ ℓ • ( G ) ${\chi }_{\ell }^{\bullet }(G)$ of a graph G $G$ is a graph invariant that has recently arisen from the study of disjoint list‐colourings. It measures how large the lists of a list‐assignment L : V ( G ) → 2 N $L:V(G)\to {2}^{{\mathbb{N}}}$ need to be to ensure the existence of a “perfectly ...
Stijn Cambie, Wouter Cames van Batenburg
wiley +1 more source
The Journal of Wildlife Management, EarlyView.We used a population viability analysis to evaluate the influence of headstarting on recovery of the Rouge National Urban Park Blanding's turtle population. Completing the remaining 12 years of the 20‐year headstarting program is projected to approximately double population size relative to no further supplementation.
Rachelle A. Fortier +4 more
wiley +1 more source
Neighborhood Broadcasting in Hypercubes
SIAM Journal on Discrete Mathematics, 2008 In the broadcasting problem, one node needs to broadcast a message to all other nodes in a network. If nodes can only communicate with one neighbor at a time, broadcasting takes at least $\lceil \log_2 N \rceil$ rounds in a network of $N$ nodes. In the neighborhood broadcasting problem, the node that is broadcasting needs to inform only its neighbors ...
Bermond, Jean-Claude +3 more
openaire +2 more sources
, 2017 We prove a tight lower bound on the asymptotic performance ratio $\rho$ of the bounded space online $d$-hypercube bin packing problem, solving an open question raised in 2005.
Kohayakawa, Y. +2 more
core
Materials Genome Engineering Advances, EarlyView.An uncertainty‐aware FEM–GPR active learning framework efficiently explores the design space of 3D braided W–Cu composites, identifying architectures with higher yield strength and preserved electrical conductivity, whereas SHAP interpretation highlights yarn spacing in the braid plane as the key structural factor controlling composite performance ...
Lai Zhang +6 more
wiley +1 more source
Hunting rabbits on the hypercube
Discrete Mathematics, 2019 We explore the Hunters and Rabbits game on the hypercube. In the process, we find the solution for all classes of graphs with an isoperimetric nesting property and find the exact hunter number of $Q^n$ to be $1+\sum\limits_{i=0}^{n-2} \binom{i}{\lfloor i/2 \rfloor}$.
Jessalyn Bolkema, Corbin Groothuis
openaire +2 more sources