Results 11 to 20 of about 2,972 (249)
Resolvability of Hamming Graphs [PDF]
SIAM Journal on Discrete Mathematics, 2020 19 pages, 2 ...
Lucas Laird +3 more
openaire +2 more sources
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
On the $$(k,\ell )$$ ( k , ℓ ) -anonymity of networks via their k-metric antidimension
Scientific Reports, 2023 This work focuses on the $$(k,\ell )$$ ( k , ℓ ) -anonymity of some networks as a measure of their privacy against active attacks. Two different types of networks are considered.
Elena Fernández +3 more
doaj +1 more source
Entanglement of free fermions on Hamming graphs
Nuclear Physics B, 2023 Free fermions on Hamming graphs H(d,q) are considered and the entanglement entropy for two types of subsystems is computed. For subsets of vertices that form Hamming subgraphs, an analytical expression is obtained.
Pierre-Antoine Bernard +2 more
doaj +1 more source
ELUSIVE CODES IN HAMMING GRAPHS [PDF]
Bulletin of the Australian Mathematical Society, 2013 AbstractWe consider a code to be a subset of the vertex set of a Hamming graph. We examine elusive pairs, code-group pairs where the code is not determined by knowledge of its set of neighbours. We construct a new infinite family of elusive pairs, where the group in question acts transitively on the set of neighbours of the code. In these examples, the
Gillespie, Neil I. +2 more
openaire +5 more sources
Multipartite information of free fermions on Hamming graphs
Nuclear Physics B, 2023 We investigate multipartite information and entanglement measures in the ground state of a free-fermion model defined on a Hamming graph. Using the known diagonalization of the adjacency matrix, we solve the model and construct the ground-state ...
Gilles Parez +3 more
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
Spectral Characterization of the Hamming Graphs [PDF]
SSRN Electronic Journal, 2007 It is shown that the Hamming graph \(H(3,q)\) with diameter three is uniquely determined by its spectrum for \(q\geq 36\). It is also demonstrated that for given integer \(D\geq 2\), any graph cospectral with the Hamming graph \(H(D,q)\) is locally the disjoint union of \(D\) copies of the complete graph of size \(q-1\), for \(q\) large enough.
Bang, S, van Dam, ER, Koolen, JH
openaire +8 more sources
PLoS Computational Biology, 2021 Graphs such as de Bruijn graphs and OLC (overlap-layout-consensus) graphs have been widely adopted for the de novo assembly of genomic short reads. This work studies another important problem in the field: how graphs can be used for high-performance ...
Yuansheng Liu, Jinyan Li
doaj +1 more source
Structural Relationship of Isomorphic Graph and its Mapping to Hamming Distance [PDF]
EPJ Web of ConferencesMapping graph isomorphism to Hamming distance enables a simple yet effective approach to quantifying structural similarity. By encoding graphs as binary adjacency vectors—flattened from the upper triangle of the adjacency matrix—structural comparisons ...
Tiwari Monika +3 more
doaj +1 more source