Results 161 to 170 of about 1,167,245 (202)

Total mutual-visibility in Hamming graphs

Opuscula Mathematica, 2023
If \(G\) is a graph and \(X \subseteq V(G)\), then \(X\) is a total mutual-visibility set if every pair of vertices \(x\) and \(y\) of \(G\) admits the shortest \(x,y\)-path \(P\) with \(V(P) \cap X \subseteq \{x,y\}\).
Csilla Bujt�s, Sandi Klav�ar, Jing Tian   +2 more
semanticscholar   +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

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

Feature Dimensionality Reduction with Graph Embedding and Generalized Hamming Distance

International Conference on Information Photonics, 2018
Principal component analysis (PCA) and linear discriminant analysis (LDA) are the most well-known methods to reduce the dimensionality of feature vectors.
Honglei Zhang, M. Gabbouj
semanticscholar   +1 more source

Hamming Graphs and Permutation Codes

2017 Fourth International Conference on Mathematics and Computers in Sciences and in Industry (MCSI), 2017
A permutation code can be represented as a graph, in which the nodes correspond to the permutation codewords and the weights on the edges are the Hamming distances between the codewords. Graphs belonging to this class are called permutation Hamming graphs.
Barta Janos, Montemanni Roberto
openaire   +1 more source

Solitaire Clobber Played on Hamming Graphs

2008
The one-player game Solitaire Clobber was introduced by Demaine et al. Beaudou et al. considered a variation called SC2. Black and white stones are located on the vertices of a given graph. A move consists in picking a stone to replace an adjacent stone of the opposite color. The objective is to minimize the number of remaining stones.
Dorbec, Paul, Duchêne, Eric, Gravier, Sylvain   +2 more
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

Graph Convolutional Multi-Label Hashing for Cross-Modal Retrieval

IEEE Transactions on Neural Networks and Learning Systems
Cross-modal hashing encodes different modalities of multimodal data into low-dimensional Hamming space for fast cross-modal retrieval. In multi-label cross-modal retrieval, multimodal data are often annotated with multiple labels, and some labels, e.g., “
Xiaobo Shen, Yinfan Chen, Weiwei Liu, Yuhui Zheng, Quansen Sun, Shirui Pan   +5 more
semanticscholar   +1 more source

Finding Diverse Strings and Longest Common Subsequences in a Graph

Annual Symposium on Combinatorial Pattern Matching
In this paper, we study for the first time the Diverse Longest Common Subsequences (LCSs) problem under Hamming distance. Given a set of a constant number of input strings, the problem asks to decide if there exists some subset $\mathcal X$ of $K ...
Yuto Shida, G. Punzi, Yasuaki Kobayashi, Takeaki Uno, Hiroki Arimura   +4 more
semanticscholar   +1 more source

Colorings of Hamming-Distance Graphs

2017
Hamming-distance graphs arise naturally in the study of error-correcting codes and have been utilized by several authors to provide new proofs for (and in some cases improve) known bounds on the size of block codes. We study various standard graph properties of the Hamming-distance graphs with special emphasis placed on the chromatic number.
openaire   +1 more source