Results 51 to 60 of about 1,167,245 (202)
J. Graph Algorithms Appl., 2020 Our objective is to discover the topology of an energy distribution network modeled by a flow digraph from which we know the set of arcs without identification of their extremities.
W. Ehounou +4 more
semanticscholar +1 more source
On metric properties of maps between Hamming spaces and related graph homomorphisms [PDF]
Journal of Combinatorial Theory, 2015 A mapping of $k$-bit strings into $n$-bit strings is called an $(\alpha,\beta)$-map if $k$-bit strings which are more than $\alpha k$ apart are mapped to $n$-bit strings that are more than $\beta n$ apart. This is a relaxation of the classical problem of
Yury Polyanskiy
semanticscholar +1 more source
Total mutual-visibility in Hamming graphs [PDF]
Opuscula MathematicaIf \(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 +2 more
doaj +1 more source
On the bandwidth of a Hamming graph
Theoretical Computer Science, 2003 The bandwidth of the Hamming graph (the product, (Kn)d, of complete graphs) has been an open question for many years. Recently Berger-Wolf and Rheingold 1] pointed out that the bandwidth of a numbering of the Hamming graph may be interpreted as a measure
L. H. Harper
semanticscholar +1 more source
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.
Bezrukov, S.L. +2 more
openaire +2 more sources
Applied SciencesThe computational tractability of Integrated Information Theory (IIT) is fundamentally constrained by the exponential cost of identifying the Minimum Information Partition (MIP), which is required to quantify integrated information (Φ).
Jaime Díaz-Arancibia +4 more
doaj +1 more source
Completely Transitive Codes in Hamming Graphs
European Journal of Combinatorics, 1999 A code \(C\) in the graph \(\Gamma\) is a non-empty subset of the vertex set \(V\) of \(\Gamma\). Completely transitive codes are a special class of completely regular codes. A code in the graph \(\Gamma\) is called a completely transitive code if there exists a subgroup \(G\) of the group of automorphisms of \(\Gamma\), such that each cell \(C_i\) in ...
Giudici, Michael, Praeger, Cheryl E.
openaire +2 more sources
Constructing DNA Codes with Larger Distance from Quaternary Words
Jambura Journal of MathematicsIn this work, we propose a novel method to construct DNA codes from quaternary words. The method uses permutation groups that act in the set {1, 2, …, 4n}, representing the coordinate and coordinate value of quaternary words.
Benediktus Panji Pradipta +1 more
doaj +1 more source
Transit sets of -point crossover operators
AKCE International Journal of Graphs and Combinatorics, 2020 -point crossover operators and their recombination sets are studied from different perspectives. We show that transit functions of -point crossover generate, for all , the same convexity as the interval function of the underlying graph.
Manoj Changat +6 more
doaj +1 more source
Variance and Covariance of Several Simultaneous Outputs of a Markov Chain [PDF]
Discrete Mathematics & Theoretical Computer Science, 2016 The partial sum of the states of a Markov chain or more generally a Markov source is asymptotically normally distributed under suitable conditions. One of these conditions is that the variance is unbounded.
Sara Kropf
doaj +1 more source