Results 11 to 20 of about 4,703 (164)
Discussiones Mathematicae Graph Theory, 2016 For k ∈ ℤ+ and G a simple, connected graph, a k-radio labeling f : V (G) → ℤ+ of G requires all pairs of distinct vertices u and v to satisfy |f(u) − f(v)| ≥ k + 1 − d(u, v). We consider k-radio labelings of G when k = diam(G).
Niedzialomski Amanda
doaj +2 more sources
Tree-Like Partial Hamming Graphs
Discussiones Mathematicae Graph Theory, 2014 Tree-like partial cubes were introduced in [B. Brešar, W. Imrich, S. Klavžar, Tree-like isometric subgraphs of hypercubes, Discuss. Math. Graph Theory, 23 (2003), 227-240] as a generalization of median graphs.
Gologranc Tanja
doaj +2 more sources
Hamming Distance Encoding Multihop Relation Knowledge Graph Completion
IEEE Access, 2020 Knowledge graphs (KGs) play an important role in many real-world applications like information retrieval, question answering, relation extraction, etc. To reveal implicit knowledge from a knowledge graph (KG), viz.
Panfeng Chen +4 more
doaj +3 more sources
Semantic ECG hash similarity graph [PDF]
Scientific ReportsGraph-based methods have made significant progress in addressing the dependent correlations among ECG time series variables. However, most existing graph structures primarily focus on local similarity while overlooking global semantic correlation ...
Yixian Fang, Shilin Zhang, Yuwei Ren
doaj +2 more sources
A note on the automorphism group of the Hamming graph [PDF]
Transactions on Combinatorics, 2021 Let $m>1$ be an integer and $\Omega$ be an $m$-set. The Hamming graph $H(n,m)$ has $\Omega ^{n}$ as its vertex-set, with two vertices are adjacent if and only if they differ in exactly one coordinate.
Seyed Morteza Mirafzal, Meysam Ziaee
doaj +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
Hamming index of graphs with respect to its incidence matrix
Indonesian Journal of Combinatorics, 2022 Let B(G) be the incidence matrix of a graph G. The row in B(G)corresponding to a vertex v, denoted by s(v) is the string which belongs to ℤm2, a set of m-tuples over a field of order two.
Harishchandra S. Ramane +6 more
doaj +1 more source
On the Hamming Spectrum and Hamming Energy of Graphs [PDF]
Discrete Mathematics LettersBojana Borovićanin +2 more
doaj +2 more sources
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 +6 more sources
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