3 research outputs found
Two coloring problems on matrix graphs
In this paper, we propose a new family of graphs, matrix graphs, whose vertex
set is the set of all matrices over a
finite field for any positive integers and . And any two
matrices share an edge if the rank of their difference is . Next, we give
some basic properties of such graphs and also consider two coloring problems on
them. Let (resp. ) denote the
minimum number of colors necessary to color the above matrix graph so that no
two vertices that are at a distance at most (resp. exactly ) get the
same color. These two problems were proposed in the study of scalability of
optical networks. In this paper, we determine the exact value of
and give some upper and lower bounds on .Comment: 9 page
New Results on Two Hypercube Coloring Problems
In this paper, we study the following two hypercube coloring problems: Given
and , find the minimum number of colors, denoted as
(resp. ), needed to color the vertices of the -cube such that
any two vertices with Hamming distance at most (resp. exactly ) have
different colors. These problems originally arose in the study of the
scalability of optical networks. Using methods in coding theory, we show that
, for any odd
number , and give two upper bounds on . The first upper
bound improves on that of Kim, Du and Pardalos. The second upper bound improves
on the first one for small . Furthermore, we derive an inequality on
and .Comment: The material in this paper was presented at The Fifth Shanghai
Conference on Combinatorics, May 14-18, 2005, Shanghai, China. This paper has
been submitted for publicatio
New bounds on a hypercube coloring problem and linear codes
In studying the scalability of optical networks, one problem arising involves coloring the vertices of the n-dimensional hypercube with as few colors as possible such that any two vertices whose Hamming distance is at most k are colored differently. Determining the exact value of O/_k(n), the minimum number of colors needed, appears tobe a difficult problem. In this paper, we improve the known An n-cube (or n-dimensional hypercube) is a graph whose vertices are the vectors of th