Results 1 to 10 of about 2,972 (249)

Daisy Hamming graphs

Discussiones Mathematicae Graph Theory, 2023
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.
Tanja Dravec, Andrej Taranenko
doaj   +4 more sources

Radio Graceful Hamming Graphs

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

Characterizing subgraphs of Hamming graphs

Journal of Graph Theory, 2005
AbstractCartesian products of complete graphs are known as Hamming graphs. Using embeddings into Cartesian products of quotient graphs we characterize subgraphs, induced subgraphs, and isometric subgraphs of Hamming graphs. For instance, a graph G is an induced subgraph of a Hamming graph if and only if there exists a labeling of E(G) fulfilling the ...
Sandi Klavžar, Iztok Peterin
exaly   +3 more sources

On k-partitioning of Hamming graphs

Discrete Applied Mathematics, 1999
For a graph \(G=(V,E)\) a \(k\)-partition is a partition \(A=\{A_1, A_2, \dots, A_k \}\) of \(V\) such that \(||A_i|- |A_j||\leq 1\) for all \(i,j\in \{1,2,\dots, k\}\). A cut of partition \(A\) is a set of edges having ends in different sets of the partition.
Sergei L. Bezrukov, Robert Elsässer, Ulf-Peter Schroeder   +2 more
exaly   +3 more sources

Combining greedy and evolutionary algorithms to maximize influence in networks under deterministic linear threshold model. [PDF]

PLoS ONE
In 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, Stepan Kochemazov, Alexander Semenov   +2 more
doaj   +2 more sources

On the P 3 -hull number of Hamming graphs

Discrete Applied Mathematics, 2020
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Boštjan Brešar, Mario Valencia-Pabon
exaly   +5 more sources

On the Hamming Spectrum and Hamming Energy of Graphs [PDF]

Discrete Mathematics Letters
Bojana Borovićanin, Nenad Stojanović, Nemanja Vučićević   +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 Making
Background 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

DAGSLAM: causal Bayesian network structure learning of mixed type data and its application in identifying disease risk factors [PDF]

BMC Medical Research Methodology
Background 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