Results 11 to 20 of about 24,879 (166)
DAGSLAM: causal Bayesian network structure learning of mixed type data and its application in identifying disease risk factors [PDF]
BMC Medical Research MethodologyBackground Identifying and understanding disease risk factors is crucial in epidemiology, particularly for chronic and noncommunicable diseases that often have complex interrelationships.
Yuanyuan Zhao, Jinzhu Jia
doaj +2 more sources
Resolvability of Hamming Graphs [PDF]
SIAM Journal on Discrete Mathematics, 2020 19 pages, 2 ...
Lucas Laird +3 more
openaire +2 more sources
On bounding the bandwidth of graphs with symmetry [PDF]
, 2015 We derive a new lower bound for the bandwidth of a graph that is based on a new lower bound for the minimum cut problem. Our new semidefinite programming relaxation of the minimum cut problem is obtained by strengthening the known semidefinite ...
Sotirov, Renata, van Dam, Edwin R.
core +7 more sources
The Square of Some Generalized Hamming Graphs
Mathematics, 2023 In this paper, we study the square of generalized Hamming graphs by the properties of abelian groups, and characterize some isomorphisms between the square of generalized Hamming graphs and the non-complete extended p-sum of complete graphs.
Yipeng Li, Jing Zhang, Meili Wang
doaj +1 more source
Perfect 2‐colorings of Hamming graphs [PDF]
Journal of Combinatorial Designs, 2021 AbstractWe consider the problem of existence of perfect 2‐colorings (equitable 2‐partitions) of Hamming graphs with given parameters. We start with conditions on parameters of graphs and colorings that are necessary for their existence. Next we observe known constructions of perfect colorings and propose some new ones giving new parameters. At last, we
Evgeny A. Bespalov +4 more
openaire +2 more sources
On the $$(k,\ell )$$ ( k , ℓ ) -anonymity of networks via their k-metric antidimension
Scientific Reports, 2023 This work focuses on the $$(k,\ell )$$ ( k , ℓ ) -anonymity of some networks as a measure of their privacy against active attacks. Two different types of networks are considered.
Elena Fernández +3 more
doaj +1 more source
s-Elusive codes in Hamming graphs [PDF]
Designs, Codes and Cryptography, 2021 A code is a subset of the vertex set of a Hamming graph. The set of $s$-neighbours of a code is the set of all vertices at Hamming distance $s$ from their nearest codeword. A code $C$ is $s$-elusive if there exists a distinct code $C'$ that is equivalent to $C$ under the full automorphism group of the Hamming graph such that $C$ and $C'$ have the same ...
openaire +4 more sources
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
Radio Number of Hamming Graphs of Diameter 3
Theory and Applications of Graphs, 2022 For $G$ a simple, connected graph, a vertex labeling $f:V(G)\to \Z_+$ is called a \emph{radio labeling of $G$} if it satisfies $|f(u)-f(v)|\geq\diam(G)+1-d(u,v)$ for all distinct vertices $u,v\in V(G)$.
Jason DeVito +2 more
doaj +1 more source
PLoS Computational Biology, 2021 Graphs such as de Bruijn graphs and OLC (overlap-layout-consensus) graphs have been widely adopted for the de novo assembly of genomic short reads. This work studies another important problem in the field: how graphs can be used for high-performance ...
Yuansheng Liu, Jinyan Li
doaj +1 more source