Results 11 to 20 of about 1,167,245 (202)
Sparse Hamming Graph: A Customizable Network-on-Chip Topology [PDF]
Design Automation Conference, 2022 Chips with hundreds to thousands of cores require scalable networks-on-chip (NoCs). Customization of the NoC topology is necessary to reach the diverse design goals of different chips.
Patrick Iff +5 more
semanticscholar +1 more source
An induced subgraph of the Hamming graph with maximum degree 1 [PDF]
Journal of Graph Theory, 2021 For every graph G $G$ , let α ( G ) $\alpha (G)$ denote its independence number. What is the minimum of the maximum degree of an induced subgraph of G $G$ with α ( G ) + 1 $\alpha (G)+1$ vertices? We study this question for the n $n$ ‐dimensional Hamming
Vincent Tandya
semanticscholar +1 more source
Resolvability of Hamming Graphs [PDF]
SIAM Journal on Discrete Mathematics, 2020 19 pages, 2 ...
Lucas Laird +3 more
openaire +2 more sources
Eigenfunctions and minimum 1-perfect bitrades in the Hamming graph [PDF]
Discrete Mathematics, 2020 The Hamming graph $H(n,q)$ is the graph whose vertices are the words of length $n$ over the alphabet $\{0,1,\ldots,q-1\}$, where two vertices are adjacent if they differ in exactly one coordinate.
A. Valyuzhenich
semanticscholar +1 more source
Perfect 2‐colorings of Hamming graphs [PDF]
Journal of Combinatorial Designs, 2021 AbstractWe consider the problem of existence of perfect 2‐colorings (equitable 2‐partitions) of Hamming graphs with given parameters. We start with conditions on parameters of graphs and colorings that are necessary for their existence. Next we observe known constructions of perfect colorings and propose some new ones giving new parameters. At last, we
Evgeny A. Bespalov +4 more
openaire +2 more sources
HS-GCN: Hamming Spatial Graph Convolutional Networks for Recommendation [PDF]
IEEE Transactions on Knowledge and Data Engineering, 2023 An efficient solution to the large-scale recommender system is to represent users and items as binary hash codes in the Hamming space. Towards this end, existing methods tend to code users by modeling their Hamming similarities with the items they ...
Han Liu +3 more
semanticscholar +1 more source
Discussiones Mathematicae Graph Theory, 2020 Summary: Daisy graphs of a rooted graph \(G\) with the root \(r\) were recently introduced as a generalization of daisy cubes, a class of isometric subgraphs of hypercubes. In this paper we first address a problem posed in [\textit{A. Taranenko}, Eur. J. Comb. 85, Article ID 103058, 10 p.
Dravec, Tanja, Taranenko, Andrej
openaire +5 more sources
Bipartite Graph Convolutional Hashing for Effective and Efficient Top-N Search in Hamming Space [PDF]
The Web Conference, 2023 Searching on bipartite graphs is basal and versatile to many real-world Web applications, e.g., online recommendation, database retrieval, and query-document searching.
Yankai Chen +3 more
semanticscholar +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
On the diameter and zero forcing number of some graph classes in the Johnson, Grassmann and Hamming association scheme [PDF]
Discrete Applied Mathematics, 2023 We determine the diameter of generalized Grassmann graphs and the zero forcing number of some generalized Johnson graphs, generalized Grassmann graphs and the Hamming graphs. Our work extends several previously known results.
A. Abiad +2 more
semanticscholar +1 more source