Results 41 to 50 of about 24,879 (166)
l1-Embeddability Under Gate-Sum Operation of Two l1-Graphs
Frontiers in Physics, 2020 An l1-graph is one in which the vertices can be labeled by binary vectors such that the Hamming distance between two binary addresses is, to scale, the distance in the graph between the corresponding vertices. This study was designed to determine whether
Guangfu Wang, Chenyang Li, Fengling Wang
doaj +1 more source
On k-partitioning of Hamming graphs
Discrete Applied Mathematics, 1999 For a graph \(G=(V,E)\) a \(k\)-partition is a partition \(A=\{A_1, A_2, \dots, A_k \}\) of \(V\) such that \(||A_i|- |A_j||\leq 1\) for all \(i,j\in \{1,2,\dots, k\}\). A cut of partition \(A\) is a set of edges having ends in different sets of the partition.
Bezrukov, S.L. +2 more
openaire +2 more sources
Completely Transitive Codes in Hamming Graphs
European Journal of Combinatorics, 1999 A code \(C\) in the graph \(\Gamma\) is a non-empty subset of the vertex set \(V\) of \(\Gamma\). Completely transitive codes are a special class of completely regular codes. A code in the graph \(\Gamma\) is called a completely transitive code if there exists a subgroup \(G\) of the group of automorphisms of \(\Gamma\), such that each cell \(C_i\) in ...
Giudici, Michael, Praeger, Cheryl E.
openaire +2 more sources
Relation between spectra of Narain CFTs and properties of associated boolean functions
Journal of High Energy Physics, 2022 Recently, the construction of Narain CFT from a certain class of quantum error correcting codes has been discovered. In particular, the spectral gap of Narain CFT corresponds to the binary distance of the code, not the genuine Hamming distance.
Yuma Furuta
doaj +1 more source
Finding Optimal Routings in Hamming Graphs
European Journal of Combinatorics, 2002 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Khoon Lim, Tian, Praeger, Cheryl E.
openaire +1 more source
Hamming Distance Encoding Multihop Relation Knowledge Graph Completion
IEEE Access, 2020 Knowledge graphs (KGs) play an important role in many real-world applications like information retrieval, question answering, relation extraction, etc. To reveal implicit knowledge from a knowledge graph (KG), viz.
Panfeng Chen +4 more
doaj +1 more source
On the Independence Graph of Hamming Graph
Iranian Journal of Mathematical Sciences and InformaticsSummary: The independence graph \(\operatorname{Ind}(G)\) of a graph \(G\) is the graph with vertices as maximum independent sets of \(G\) and two vertices are adjacent, if and only if the corresponding maximum independent sets are disjoint. In this work, we find the independence graph of Cartesian product of \(d\) copies of complete graphs \(K_q ...
Saravanan, M., Kathiresan, KM.
openaire +2 more sources
Journal of Integrative Bioinformatics, 2004 We propose a method for visualizing a set of related metabolic pathways across organisms using 2 1/2 dimensional graph visualization. Interdependent, twodimensional layouts of each pathway are stacked on top of each other so that biologists get a full ...
Brandes Ulrik, Dwyer Tim, Schreiber Falk
doaj +1 more source
Neighbour transitivity on codes in Hamming graphs
, 2011 We consider a \emph{code} to be a subset of the vertex set of a \emph{Hamming graph}. In this setting a \emph{neighbour} of the code is a vertex which differs in exactly one entry from some codeword.
Cheryl E. Praeger +8 more
core +1 more source
Retracts of Infinite Hamming Graphs
Journal of Combinatorial Theory, Series B, 1997 A Hamming graph is a Cartesian product of complete graphs. We show that (finite or infinite) quasi-median graphs, which are a generalization of median graphs, are exactly the retracts of Hamming graphs. This generalizes a result of \textit{H. J. Bandelt} [J.
openaire +2 more sources