Results 1 to 10 of about 24,879 (166)
Discussiones Mathematicae Graph Theory, 2023 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 solve the problem posed in \cite{Taranenko2020} and characterize rooted
Tanja Dravec, Andrej Taranenko
doaj +7 more sources
Elusive Codes in Hamming Graphs [PDF]
Bulletin of the Australian Mathematical Society, 2012 We 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.
Gillespie, Neil I. +2 more
core +6 more sources
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
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 +4 more sources
Spectral Characterization of the Hamming Graphs [PDF]
SSRN Electronic Journal, 2007 We show that the Hamming graph H(3; q) with diameter three is uniquely determined by its spectrum for q ¸ 36. Moreover, we show that for given integer D ¸ 2, any graph cospectral with the Hamming graph H(D; q) is locally the disjoint union of D copies of
Bang, S., Dam, E.R. van, Koolen, J.H.
core +10 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
Entanglement of free fermions on Hamming graphs
Nuclear Physics B, 2023 Free fermions on Hamming graphs H(d,q) are considered and the entanglement entropy for two types of subsystems is computed. For subsets of vertices that form Hamming subgraphs, an analytical expression is obtained.
Pierre-Antoine Bernard +2 more
doaj +3 more sources
Generalized Hamming Graphs: Some New Results
Discussiones Mathematicae Graph Theory, 2018 A projection of a vertex x of a graph G over a subset S of vertices is a vertex of S at minimal distance from x. The study of projections over quasi-intervals gives rise to a new characterization of quasi-median graphs.
Bedrane Amari, Abdelhafid Berrachedi
doaj +2 more sources
Combining greedy and evolutionary algorithms to maximize influence in networks under deterministic linear threshold model. [PDF]
PLoS ONEIn the paper we consider the well-known Influence Maximization (IM) and Target Set Selection (TSS) problems for Boolean networks under Deterministic Linear Threshold Model (DLTM).
Alexander Andreev +2 more
doaj +2 more sources
Developing a novel causal inference algorithm for personalized biomedical causal graph learning using meta machine learning [PDF]
BMC Medical Informatics and Decision MakingBackground Modeling causality through graphs, referred to as causal graph learning, offers an appropriate description of the dynamics of causality.
Hang Wu, Wenqi Shi, May D. Wang
doaj +2 more sources