Results 71 to 80 of about 4,703 (164)
Finding Optimal Routings in Hamming Graphs
European Journal of Combinatorics, 2002 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Tian Khoon Lim, Cheryl E. Praeger
openaire +1 more source
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
On the Complexity of Recognizing Hamming Graphs and Related Classes of Graphs
European Journal of Combinatorics, 1996 The authors survey recognition algorithms for Hamming graphs (i.e. Cartesian products of complete graphs), retracts of Hamming graphs and isometric subgraphs of Hamming graphs. The paper also contains a new algorithm that recognizes whether a given graph \(G= (V, E)\) is a Hamming graph in \(O(|E|)\) time and \(O(|V|^2)\) space.
Wilfried Imrich, Sandi Klavzar
openaire +1 more source
Eigenspaces of Hamming graphs and unitary Cayley graphs
Ars Mathematica Contemporanea, 2010 In this work, the eigenspaces of unitary Cayley graphs and certain Hamming graphs are considered. It is shown that these graph classes are closely related and admit particularly simple eigenspace bases for all eigenvalues, namely bases containing vectors only with entries from the set {0, 1, −1}.
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
On the P 3 -hull number of Hamming graphs
Discret. Appl. Math., 2020 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Bostjan Bresar, Mario Valencia-Pabon
openaire +4 more sources
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.
Marc Chastand, Norbert Polat
openaire +1 more source
Root Systems and The Johnson and Hamming Graphs
European Journal of Combinatorics, 1987 Let \(\Gamma\) be any distance regular graph with diameter d, \(c_ 2\geq 0\) and \[ c_ i-c_{i-1}+b_{i-1}-b_ i-a_ i-2=0. \] Then it is shown that \(\Gamma\) is a graph of Hamming type one of the Johnson graphs, the halved graph of the n-cube, a cocktail party graph, the Shrikhande graph or one of a finite number of exceptional graphs with \(d\leq 8 ...
openaire +2 more sources
Minimum supports of eigenfunctions of Hamming graphs
Discrete Mathematics, 2017 in ...
openaire +3 more sources
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