Distance Labelling Problems for Hypercubes and Hamming Graphs - A Survey
نویسنده
چکیده
We survey recent results on a few distance labelling problems for hypercubes and Hamming graphs.
منابع مشابه
Labelling Cayley Graphs on Abelian Groups
For given integers j ≥ k ≥ 1, an L(j, k)-labelling of a graph Γ is an assignment of labels—nonnegative integers—to the vertices of Γ such that adjacent vertices receive labels that differ by at least j, and vertices distance two apart receive labels that differ by at least k. The span of such a labelling is the difference between the largest and the smallest labels used, and the minimum span ov...
متن کاملIsometric embeddings in Hamming graphs
The results presented in this paper are parts of my doctoral thesis [ 193; the algorithm and some of the characterizations in Section 7 have been introduced in [ 181. Motivation for isometric embeddings into Hamming graphs has come from communication theory (Graham and Pollak [ 121) an-d linguistics (Firsov 1181). Isometric subgraphs of Hamming graphs also appear in biology as “quasi-species” (...
متن کاملPartial Hamming graphs and expansion procedures
Structural properties of isometric subgraphs of Hamming graphs are presented, generalizing certain results on quasi-median graphs. Consequently, a relation on the edge set of a graph which is closely related to Winkler–Djokovi6 c’s relation is introduced and used for a characterization of isometric subgraphs of Hamming graphs. Moreover, some results considering semi-median graphs and expansions...
متن کاملRecognizing Hamming Graphs in Linear Time and space
Hamming graphs are, by definition, the Cartesian product of complete graphs. In the bipartite case these graphs are hypercubes. We present an algorithm recognizing Hamming graphs in linear time and space. This improves a previous algorithm which was linear in time but not in space. This also favorably compares to the general decomposition algorithms of graphs with respect to the Cartesian produ...
متن کاملSolitaire Clobber Played on Hamming Graphs
The one-player game Solitaire Clobber was introduced by Demaine et al. Beaudou et al. considered a variation called SC2. Black and white stones are located on the vertices of a given graph. A move consists in picking a stone to replace an adjacent stone of the opposite color. The objective is to minimize the number of remaining stones. The game is interesting if there is at least one stone of e...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Electronic Notes in Discrete Mathematics
دوره 28 شماره
صفحات -
تاریخ انتشار 2007