Results 21 to 30 of about 1,167,245 (202)
Hamming Similarity and Graph Laplacians for Class Partitioning and Adversarial Image Detection [PDF]
2023 IEEE/CVF Conference on Computer Vision and Pattern Recognition Workshops (CVPRW), 2023 Researchers typically investigate neural network representations by examining activation outputs for one or more layers of a network. Here, we investigate the potential for ReLU activation patterns (encoded as bit vectors) to aid in understanding and ...
Huma Jamil +6 more
semanticscholar +1 more source
ON DISTANCE–REGULAR GRAPHS OF DIAMETER 3 WITH EIGENVALUE \(\theta=1\)
Ural Mathematical Journal, 2022 For a distance-regular graph \(\Gamma\) of diameter 3, the graph \(\Gamma_i\) can be strongly regular for \(i=2\) or 3. J.Kulen and co-authors found the parameters of a strongly regular graph \(\Gamma_2\) given the intersection array of the graph ...
Alexander A. Makhnev +2 more
doaj +1 more source
s-Elusive codes in Hamming graphs [PDF]
Designs, Codes and Cryptography, 2021 A code is a subset of the vertex set of a Hamming graph. The set of $s$-neighbours of a code is the set of all vertices at Hamming distance $s$ from their nearest codeword. A code $C$ is $s$-elusive if there exists a distinct code $C'$ that is equivalent to $C$ under the full automorphism group of the Hamming graph such that $C$ and $C'$ have the same ...
openaire +4 more sources
Existence of a phase transition of the interchange process on the Hamming graph [PDF]
Electronic Journal of Probability, 2016 The interchange process on a finite graph is obtained by placing a particle on each vertex of the graph, then at rate 1, selecting an edge uniformly at random and swapping the two particles at either end of this edge.
Bati Sengul, Piotr Milos
semanticscholar +1 more source
The Square of Some Generalized Hamming Graphs
Mathematics, 2023 In this paper, we study the square of generalized Hamming graphs by the properties of abelian groups, and characterize some isomorphisms between the square of generalized Hamming graphs and the non-complete extended p-sum of complete graphs.
Yipeng Li, Jing Zhang, Meili Wang
doaj +1 more source
Queue Layouts of Graph Products and Powers [PDF]
Discrete Mathematics & Theoretical Computer Science, 2005 A \emphk-queue layout of a graph G consists of a linear order σ of V(G), and a partition of E(G) into k sets, each of which contains no two edges that are nested in σ .
David R. Wood
doaj +1 more source
Radio Number of Hamming Graphs of Diameter 3
Theory and Applications of Graphs, 2022 For $G$ a simple, connected graph, a vertex labeling $f:V(G)\to \Z_+$ is called a \emph{radio labeling of $G$} if it satisfies $|f(u)-f(v)|\geq\diam(G)+1-d(u,v)$ for all distinct vertices $u,v\in V(G)$.
Jason DeVito +2 more
doaj +1 more source
Phase transition for the interchange and quantum Heisenberg models on the Hamming graph [PDF]
, 2018 We study a family of random permutation models on the $2$-dimensional Hamming graph $H(2,n)$, containing the interchange process and the cycle-weighted interchange process with parameter $\theta > 0$. This family contains the random representation of the
Radosław Adamczak +2 more
semanticscholar +1 more source
Maximal m-distance sets containing the representation of the Hamming graph H(n, m) [PDF]
Discrete Mathematics, 2016 A set $X$ in the Euclidean space $\mathbb{R}^d$ is called an $m$-distance set if the set of Euclidean distances between two distinct points in $X$ has size $m$.
S. Adachi +3 more
semanticscholar +1 more source
Isometric Hamming embeddings of weighted graphs
Discrete Applied Mathematics, 2023 A mapping $ : V(G) \to V(H)$ from the vertex set of one graph $G$ to another graph $H$ is an isometric embedding if the shortest path distance between any two vertices in $G$ equals the distance between their images in $H$. Here, we consider isometric embeddings of a weighted graph $G$ into unweighted Hamming graphs, called Hamming embeddings, when $G$
Joseph Berleant +4 more
openaire +3 more sources