Results 31 to 40 of about 2,972 (249)

Sensitivity and Hamming Graphs

Journal of Graph Theory
ABSTRACT For any we show that the Hamming graph admits an imbalanced partition into sets, each inducing a subgraph of low maximum degree. This improves previous results by Tandya and by Potechin and Tsang, and disproves the Strong ‐ary Sensitivity Conjecture of Asensio, García‐Marco, and Knauer.
Sara Asensio, Yuval Filmus, Ignacio García‐Marco, Kolja Knauer   +3 more
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

Generalized Hamming Graphs: Some New Results

Discussiones Mathematicae Graph Theory, 2018
A projection of a vertex x of a graph G over a subset S of vertices is a vertex of S at minimal distance from x. The study of projections over quasi-intervals gives rise to a new characterization of quasi-median graphs.
Bedrane Amari, Abdelhafid Berrachedi
doaj   +1 more source

Axiomatic characterization of the interval function of partial cubes and partial Hamming graphs

AKCE International Journal of Graphs and Combinatorics
Interval 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, Manoj Changat, Lekshmi Kamal K. Sheela, Abhirami R. S, Amrutha U.A.   +4 more
doaj   +1 more source

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

On the Independence Graph of Hamming Graph

Iranian Journal of Mathematical Sciences and Informatics
Summary: The independence graph \(\operatorname{Ind}(G)\) of a graph \(G\) is the graph with vertices as maximum independent sets of \(G\) and two vertices are adjacent, if and only if the corresponding maximum independent sets are disjoint. In this work, we find the independence graph of Cartesian product of \(d\) copies of complete graphs \(K_q ...
Saravanan, M., Kathiresan, KM.
openaire   +2 more sources

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

The retracts of Hamming graphs

Discrete Mathematics, 1992
All graphs considered are finite undirected simple ones. The object of this article is the investigation of the so-called quasimedian graphs. In detail known results, especially of \textit{H. M. Mulder}, are presented, the essential concepts and their properties are placed at disposal and to it many definitions are necessary, the most important of them
openaire   +1 more source

An isoform of 14‐3‐3 protein regulates transbilayer lipid movement at the plasma membrane

FEBS Letters, EarlyView.
Loss of 14‐3‐3ζ in CHO cells confers resistance to exogenous phosphatidylserine (PS) and impairs endocytosis‐independent inward flip‐flop of fluorescent PS at the plasma membrane. RNAi‐mediated knockdown reproduces this defect, while no additive effect is seen in ATP11C‐deficient cells.
Akiko Yamaji‐Hasegawa, Akira Hattori, Masafumi Tsujimoto, Toshihide Kobayashi   +3 more
wiley   +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