46 search results - page 2 / 10 » On k-partitioning of Hamming Graphs |
ENDM
2007
13 years 7 months ago
2007
We survey recent results on a few distance labelling problems for hypercubes and Hamming graphs.
GC
2008
Springer
13 years 7 months ago
2008
Springer
An acyclic coloring of a graph G is a proper coloring of the vertex set of G such that G contains no bichromatic cycles. The acyclic chromatic number of a graph G is the minimum nu...
JSC
2010
13 years 5 months ago
2010
We examine designs and binary codes associated with the line graph of the n-cube Qn, i.e. the Hamming graph H(n, 2). We find the automorphism groups and the parameters of the cod...
18
Voted
EJC
2010
13 years 7 months ago
2010
Let a graph be locally disjoint union of three copies of complete graphs Kq-1 and let be cospectral with the Hamming graph H(3, q). Bang and Koolen [Asian-Eur. J. Math. 1 (2008),...
EJC
2006
13 years 7 months ago
2006
Average distance of a graph is expressed in terms of its canonical metric representation. The equality can be modified to an inequality in such a way that it characterizes isometr...