Results 31 to 40 of about 1,167,245 (202)
On the $Q$-Polynomial Property of the Full Bipartite Graph of a Hamming Graph [PDF]
Electronic Journal of CombinatoricsThe $Q$-polynomial property is an algebraic property of distance-regular graphs, that was introduced by Delsarte in his study of coding theory. Many distance-regular graphs admit the $Q$-polynomial property. Only recently the $Q$-polynomial property has
Blas Fernández +3 more
semanticscholar +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
Connectivity threshold for random subgraphs of the Hamming graph [PDF]
, 2015 We study the connectivity of random subgraphs of the $d$-dimensional Hamming graph $H(d, n)$, which is the Cartesian product of $d$ complete graphs on $n$ vertices. We sample the random subgraph with an i.i.d.\ Bernoulli bond percolation on $H(d,n)$ with
Lorenzo Federico +2 more
semanticscholar +1 more source
The improved hamming number method to detect isomorphism for kinematic chain with multiple joints
Journal of Advanced Mechanical Design, Systems, and Manufacturing, 2017 During the process of kinematic structure enumeration using graph theory, isomorphism identification of graphs is an important and complicated problem.
Wei SUN, Jianyi KONG, Liangbo SUN
doaj +1 more source
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
Arithmetic completely regular codes [PDF]
Discrete Mathematics & Theoretical Computer Science, 2016 In this paper, we explore completely regular codes in the Hamming graphs and related graphs. Experimental evidence suggests that many completely regular codes have the property that the eigenvalues of the code are in arithmetic progression.
Jacobus Koolen +3 more
doaj +1 more source
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
Eccentric Harmonic Index for the Cartesian Product of Graphs
Journal of Mathematics, 2022 Suppose ρ is a simple graph, then its eccentric harmonic index is defined as the sum of the terms 2/ea+eb for the edges vavb, where ea is the eccentricity of the ath vertex of the graph ρ. We symbolize the eccentric harmonic index (EHI) as He=Heρ.
Kamel Jebreen +5 more
doaj +1 more source
Random subgraphs of the 2D Hamming graph: the supercritical phase [PDF]
, 2008 We study random subgraphs of the 2-dimensional Hamming graph H(2,n), which is the Cartesian product of two complete graphs on n vertices. Let p be the edge probability, and write $${p={(1+\varepsilon)}/{(2(n-1))}}$$ for some $${\varepsilon \in \mathbb{R}}
R. Hofstad, M. Luczak
semanticscholar +1 more source
The second largest component in the supercritical 2D Hamming graph [PDF]
Random Struct. Algorithms, 2008 The two‐dimensional Hamming graph H(2,n) consists of the n2 vertices (i,j), 1 ≤ i,j ≤ n, two vertices being adjacent when they share a common coordinate. We examine random subgraphs of H(2,n) in percolation with edge probability p, in such a way that the
R. Hofstad, M. Luczak, J. Spencer
semanticscholar +1 more source