Results 31 to 40 of about 24,879 (166)
How Long Can One Bluff in the Domination Game?
Discussiones Mathematicae Graph Theory, 2017 The domination game is played on an arbitrary graph G by two players, Dominator and Staller. The game is called Game 1 when Dominator starts it, and Game 2 otherwise.
Brešar Boštan +3 more
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
Structured LDPC Codes over Integer Residue Rings
EURASIP Journal on Wireless Communications and Networking, 2008 This paper presents a new class of low-density parity-check (LDPC) codes over ℤ2a represented by regular, structured Tanner graphs. These graphs are constructed using Latin squares defined over a multiplicative group of a Galois ring, rather than a ...
Marc A. Armand, Elisa Mo
doaj +2 more sources
Diagonally Neighbour Transitive Codes and Frequency Permutation Arrays [PDF]
, 2014 Constant composition codes have been proposed as suitable coding schemes to solve the narrow band and impulse noise problems associated with powerline communication.
A. Neumaier +19 more
core +4 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
Axiomatic characterization of the interval function of partial cubes and partial Hamming graphs
AKCE International Journal of Graphs and CombinatoricsInterval function of a graph is a well-known notion in metric graph theory and the axiomatic characterization using a set of first order axioms of different graph classes is an interesting problem in this area.
Jeny Jacob +4 more
doaj +1 more source
Quantum walks on graphs of the ordered Hamming scheme and spin networks
SciPost Physics, 2019 It is shown that the hopping of a single excitation on certain triangular spin lattices with non-uniform couplings and local magnetic fields can be described as the projections of quantum walks on graphs of the ordered Hamming scheme of depth 2.
Hiroshi Miki, Satoshi Tsujimoto, Luc Vinet
doaj +1 more source
Some variants of reverse selective center location problem on trees under the Chebyshev and Hamming norms [PDF]
Yugoslav Journal of Operations Research, 2017 This paper is concerned with two variants of the reverse selective center location problems on tree graphs under the Hamming and Chebyshev cost norms in which the customers are existing on a selective subset of the vertices of the underlying tree.
Etemad Roghayeh, Alizadeh Behrooz
doaj +1 more source
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