Results 41 to 50 of about 148 (115)
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
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 Klavzar, Iztok Peterin
openaire +2 more sources
Weighted Szeged indices of some graph operations [PDF]
Transactions on Combinatorics, 2016 In this paper, the weighted Szeged indices of Cartesian product and Corona product of twoconnected graphs are obtained. Using the results obtained here, the weighted Szeged indices ofthe hypercube of dimension n, Hamming graph, C4 nanotubes, nanotorus ...
Kannan Pattabiraman, P. Kandan
doaj
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
Hamming graphs in Nomura algebras
Linear Algebra and its Applications, 2011 Let A be an association scheme on q\geq 3 vertices. We show that the Bose-Mesner algebra of the generalized Hamming scheme H(n,A), for n\geq 2, is not the Nomura algebra of a type II matrix. This result gives examples of formally self-dual Bose-Mesner algebras that are not the Nomura algebras of type II matrices.
Chan, Ada, Munemasa, Akihiro
openaire +2 more sources
Betweenness centrality in Cartesian product of graphs
AKCE International Journal of Graphs and Combinatorics, 2020 Betweenness centrality is a widely used measure in various graphs and it has a pivotal role in the analysis of complex networks. It measures the potential or power of a node to control the communication over the network.
Sunil Kumar R., Kannan Balakrishnan
doaj +1 more source
IEEE Access, 2022 Learning the structure of Bayesian networks is a challenging problem because it is a NP-Hard problem. As an excellent search & score based method, the K2 algorithm strongly depends on the input of global order of all nodes to ensure the result is ...
Kunhua Zhong +3 more
doaj +1 more source
Retracts of Infinite Hamming Graphs
Journal of Combinatorial Theory, Series B, 1997 A Hamming graph is a Cartesian product of complete graphs. We show that (finite or infinite) quasi-median graphs, which are a generalization of median graphs, are exactly the retracts of Hamming graphs. This generalizes a result of \textit{H. J. Bandelt} [J.
openaire +2 more sources
Antibandwidth and cyclic antibandwidth of Hamming graphs
Discrete Applied Mathematics, 2009 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Stefan Dobrev +4 more
openaire +2 more sources