Results 61 to 70 of about 24,879 (166)
Distance-regular graphs of hamming type
Journal of Combinatorial Theory, Series B, 1990 An H(e,\(\lambda\),k)-graph is defined to be a distance-regular graph with the following intersection array \[ \left\{\begin{matrix} 0 & 1 & 2 &... & e-1 & e & *...* \\ 0 & \lambda & 2\lambda & ... & (e-1)\lambda & * & *...* & \\ k & * & * & ... & * & * & *...* \end{matrix}\right\} \] where * takes an arbitrary value under the restriction that each ...
openaire +2 more sources
Combinatorial PDEs on Hamming graphs
Discrete Mathematics, 2002 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
BARLETTA, Elisabetta, DRAGOMIR, Sorin
openaire +1 more source
On induced subgraphs of the Hamming graph [PDF]
Journal of Graph Theory, 2020 AbstractIn connection with his solution of the Sensitivity Conjecture, Hao Huang (arXiv: 1907.00847, 2019) asked the following question: Given a graph with high symmetry, what can we say about the smallest maximum degree of induced subgraphs of with vertices, where denotes the size of the largest independent set in ?
openaire +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 ...
Klavžar, Sandi, Peterin, Iztok
openaire +2 more sources
On the Automatic Analysis of the Practical Resistance of Obfusting Transformations
Моделирование и анализ информационных систем, 2019 A method is developed for assessing the practical persistence of obfuscating transformations of programs based on the calculation of the similarity index for the original, obfuscated and deobfuscated programs.
Petr D. Borisov, Yu. V. Kosolapov
doaj +1 more source
Sensitivity and Hamming graphs
For any $m\geq 3$ we show that the Hamming graph $H(n,m)$ admits an imbalanced partition into $m$ sets, each inducing a subgraph of low maximum degree. This improves previous results by Tandya and by Potechin and Tsang, and disproves the Strong $m$-ary Sensitivity Conjecture of Asensio, García-Marco, and Knauer. On the other hand, we prove their weaker
Asensio, Sara +3 more
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.
Dobrev, Stefan +4 more
openaire +2 more sources
Parameter Setting in Quantum Approximate Optimization of Weighted Problems [PDF]
QuantumQuantum Approximate Optimization Algorithm (QAOA) is a leading candidate algorithm for solving combinatorial optimization problems on quantum computers. However, in many cases QAOA requires computationally intensive parameter optimization.
Shree Hari Sureshbabu +6 more
doaj +1 more source
Classification and Galois conjugacy of Hamming maps
, 2010 We show that for each d>0 the d-dimensional Hamming graph H(d,q) has an orientably regular surface embedding if and only if q is a prime power p^e.
Jones, Gareth A.
core +1 more source
Unveiling Internet Streaming Services: A Comparison Using Neutrosophic Graphs
Fuzzy Information and EngineeringThis paper investigates the inverse of the maximum result obtained by multiplying two unique graph types known as neutrosophic graphs. The main goal is to comprehend a point’s degree in the opposite situation of a neutrosophic graph’s maximum product ...
M. Kaviyarasu
doaj +1 more source