Results 31 to 40 of about 5,839 (198)
Journal of Mathematical Sciences and Modelling, 2018 We obtain the generating functions for the combinatorial enumeration of colorings of all hyperplanes of hypercubes for all irreducible representations of the hyperoctahedral groups.
Krishnan Balasubramanian
doaj +1 more source
Regularity of optimal mapping between hypercubes
Advanced Nonlinear Studies, 2023 In this note, we establish the global C3,α{C}^{3,\alpha } regularity for potential functions in optimal transportation between hypercubes in Rn{{\mathbb{R}}}^{n} for n≥3n\ge 3. When n=2n=2, the result was proved by Jhaveri.
Chen Shibing, Liu Jiakun, Wang Xu-Jia
doaj +1 more source
Discussiones Mathematicae Graph Theory, 2014 Summary: Let \(G\) be a graph that is a subgraph of some \(n\)-dimensional hypercube \(Q_n\). For sufficiently large \(n\), \textit{Q. Stout} [``Packings in hypercubes'', presented at the 21st Southeastern international conference on combinatorics, graph theory, and computing, Boca Raton, FL (1990), \url{http://www.eecs.umich.edu/~qstout/abs/hyppack ...
openaire +4 more sources
SIAM Journal on Discrete MathematicsAbstract. A subset [Formula: see text] of the Boolean hypercube [Formula: see text] is a sumset if [Formula: see text] for some [Formula: see text]. We prove that the number of sumsets in [Formula: see text] is asymptotically [Formula: see text].
Noga Alon, Or Zamir
openaire +5 more sources
, 2022 These hypercubes generalize the well-known Graeco-Latin squares. In one dimension m hypercube we have pm 'points' with m coordinates taking the values 0; 1; : : : ; p 1. In each point we locate letters from m distinct alphabets. When we vary one of the
Mexia, João T. +3 more
core
On metric dimensions of hypercubes
Ars Mathematica Contemporanea, 2022 The metric (resp. edge metric or mixed metric) dimension of a graph $G$, is the cardinality of the smallest ordered set of vertices that uniquely recognizes all the pairs of distinct vertices (resp. edges, or vertices and edges) of $G$ by using a vector of distances to this set. In this note we show two unexpected results on hypercube graphs. First, we
Aleksander Kelenc +3 more
openaire +5 more sources
Construction of orthogonal and nearly orthogonal Latin hypercubes
, 2009 We propose a method for constructing orthogonal or nearly orthogonal Latin hypercubes. The method yields a large Latin hypercube by coupling an orthogonal array of index unity with a small Latin hypercube.
Boxin Tang +5 more
core +1 more source
Some Properties on Estrada Index of Folded Hypercubes Networks
Abstract and Applied Analysis, 2014 Let G be a simple graph with n vertices and let λ1,λ2,…,λn be the eigenvalues of its adjacency matrix; the Estrada index EEG of the graph G is defined as the sum of the terms eλi, i=1,2,…,n.
Jia-Bao Liu, Xiang-Feng Pan, Jinde Cao
doaj +1 more source
4-cycle properties for characterizing rectagraphs and hypercubes [PDF]
, 2017 summary:A $(0,2)$-graph is a connected graph, where each pair of vertices has either 0 or 2 common neighbours. These graphs constitute a subclass of $(0,\lambda )$-graphs introduced by Mulder in 1979.
Berrachedi, Abdelhafid, Bouanane, Khadra
core +2 more sources
The Kirchhoff Index of Hypercubes and Related Complex Networks
Discrete Dynamics in Nature and Society, 2013 The resistance distance between any two vertices of G is defined as the network effective resistance between them if each edge of G is replaced by a unit resistor.
Jiabao Liu +3 more
doaj +1 more source