Results 81 to 90 of about 1,167,245 (202)
Distance-regular graphs of hamming type
Journal of Combinatorial Theory, Series B, 1990 An H(e,\(\lambda\),k)-graph is defined to be a distance-regular graph with the following intersection array \[ \left\{\begin{matrix} 0 & 1 & 2 &... & e-1 & e & *...* \\ 0 & \lambda & 2\lambda & ... & (e-1)\lambda & * & *...* & \\ k & * & * & ... & * & * & *...* \end{matrix}\right\} \] where * takes an arbitrary value under the restriction that each ...
openaire +2 more sources
Combinatorial PDEs on Hamming graphs
Discrete Mathematics, 2002 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
BARLETTA, Elisabetta, DRAGOMIR, Sorin
openaire +1 more source
Characterizing subgraphs of Hamming graphs
Journal of Graph Theory, 2005 AbstractCartesian products of complete graphs are known as Hamming graphs. Using embeddings into Cartesian products of quotient graphs we characterize subgraphs, induced subgraphs, and isometric subgraphs of Hamming graphs. For instance, a graph G is an induced subgraph of a Hamming graph if and only if there exists a labeling of E(G) fulfilling the ...
Klavžar, Sandi, Peterin, Iztok
openaire +2 more sources
Graphical ModelsAdvanced quantum computers have the capability to perform practical quantum computing to address specific problems that are intractable for classical computers.
Jieyi Chen +6 more
doaj +1 more source
Antibandwidth and cyclic antibandwidth of Hamming graphs
Discrete Applied Mathematics, 2009 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Dobrev, Stefan +4 more
openaire +2 more sources
CONTINUITY OF UNIVERSALLY MEASURABLE HOMOMORPHISMS
Forum of Mathematics, Pi, 2019 Answering a longstanding problem originating in Christensen’s seminal work on Haar null sets [Math. Scand. 28 (1971), 124–128; Israel J. Math. 13 (1972), 255–260; Topology and Borel Structure.
CHRISTIAN ROSENDAL
doaj +1 more source
Invariant Hamming graphs in infinite quasi-median graphs
Discrete Mathematics, 1996 A Hamming graph is a Cartesian product of complete graphs. The main results of the paper are: (i) a quasi-median graph without isometric rays contains a Hamming graph which is invariant under any automorphism; and (ii) any contraction of a rayless quasi-median graph stabilizes a finite Hamming graph.
Chastand, Marc, Polat, Norbert
openaire +1 more source
Isometric embeddings in Hamming graphs
Journal of Combinatorial Theory, Series B, 1990 An \(O(n^ 3)\)-algorithm is established which embeds a given graph isometrically into a Hamming graph (i.e., a Cartesian product of complete graphs) whenever possible, and recognizes non-embeddable graphs. From the algorithm several characterizations of the embeddable graphs are derived.
openaire +2 more sources
The retracts of Hamming graphs
Discrete Mathematics, 1992 All graphs considered are finite undirected simple ones. The object of this article is the investigation of the so-called quasimedian graphs. In detail known results, especially of \textit{H. M. Mulder}, are presented, the essential concepts and their properties are placed at disposal and to it many definitions are necessary, the most important of them
openaire +1 more source
\(L(h,k)\)-labelings of Hamming graphs
Discrete Mathematics, 2009 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Huang, L.-H., Chang, G. J.
openaire +2 more sources