Results 231 to 240 of about 2,988 (254)

Matchings in Lattice Graphs and Hamming Graphs

Combinatorics, Probability and Computing, 1994
In this paper we solve the following problem on the lattice graph L(m1,…,mn) and the Hamming graph H(m1,…,mn), generalizing a result of Felzenbaum-Holzman-Kleitman on the n-dimensional cube (all mi = 2): Characterize the vectors (s1.…,sn) such that there exists a maximum matching in L, respectively, H with exactly si edges in the ith direction.
Martin Aigner 0001, Regina Klimmek
openaire   +2 more sources

Hamming Matrix and Hamming Energy of a Graph

Match Communications in Mathematical and in Computer Chemistry
Hamming distance is a highly valuable quantity in computer science. In this work, we establish the Hamming matrix H of a graph G, H(G). This is a square matrix, where the elements of the H(G) are Hamming distances. Also, we define the Hamming energy of a graph, HE(G), which is a sum of the absolute eigenvalues of H(G).
Nemanja Vučićević, Izudin Redžepović, Nenad Stojanović   +2 more
openaire   +1 more source

Phylogeny Numbers of Generalized Hamming Graphs

Bulletin of the Malaysian Mathematical Sciences Society, 2022
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Chengyang Qian, Yaokun Wu, Yanzhen Xiong
openaire   +2 more sources

Hamming index of product graphs

Discrete Mathematics, Algorithms and Applications
Let [Formula: see text] be a simple graph of order [Formula: see text]. The adjacency matrix of [Formula: see text] is a square matrix of order [Formula: see text], whose elements are [Formula: see text], if the corresponding vertices are adjacent and [Formula: see text], if the corresponding vertices are non-adjacent.
A. Harshitha, Sabitha D'Souza
openaire   +1 more source

Permutation Codes, Hamming Graphs and Turán Graphs

2019
This paper investigates the properties of permutation Hamming graphs, a class of graphs in which the vertices are the permutations of n symbols and the edges connect pairs of vertices at a Hamming distance greater than or equal to a value d. Despite a remarkable regularity, permutation Hamming graphs elude general formulas for relevant indicators like ...
Barta Janos, Montemanni Roberto
openaire   +1 more source

On the Eigenvalues of Hamming Matrix and Hamming Energy of a Graph

Creative Mathematics and Informatics
Let G be a graph with n vertices and m edges. Let V(G) = {v1,v2,...,vn} be the vertex set of G. Thestring s(vi) is the row in the incidence matrix of G corresponding to the vertex vi, which is an m-tuple in Zm 2 . The Hamming matrix H(G) = [hij] of a graph G is an n×nmatrix, whose (i,j)-th entry is the Hamming distance between the strings s(vi) and
HARISHCHANDRA S. RAMANE, T. SHIVAPRASAD, SHEENA Y. CHOWRI   +2 more
openaire   +1 more source

Isometric Hamming embeddings of weighted graphs

Discrete Applied Mathematics, 2023
Joseph Don Berleant, Mark Bathe, Kristin Sheridan   +2 more
exaly  

Vapnik–Chervonenkis dimension and density on Johnson and Hamming graphs

Discrete Applied Mathematics, 2022
Isolde Adler, H Dugald Macpherson
exaly  

Edge distance-balanced of Hamming graphs

Journal of Discrete Mathematical Sciences and Cryptography, 2022
Hamed Karami
exaly  

Codes from incidence matrices and line graphs of Hamming graphs

Discrete Mathematics, 2010
Washiela Fish, E Mwambene, J D Key
exaly