A distance-labelling problem for hypercubes
type: Item
instance of: scholarly article
title: A distance-labelling problem for hypercubes
zbMATH Open document ID: 1170.05052
author: Sanming Zhou
published in: Discrete Applied Mathematics
publication date: 2009-03-09T00:00:00Z
Mathematics Subject Classification ID: 05C78
Mathematics Subject Classification ID: 05C12
zbMATH DE Number: 5526336
zbMATH Keywords: channel assignment
zbMATH Keywords: labelling
zbMATH Keywords: \(\lambda \)-number
zbMATH Keywords: distance-colouring
zbMATH Keywords: hypercube
zbMATH Keywords: binary code
MaRDI profile type: Publication
full work available at URL: j.dam.2007.11.018
OpenAlex ID: W2017176397
cites work: On labeling the vertices of products of complete graphs with distance constraints
cites work: Q4949819
cites work: Labeling products of complete graphs with a condition at distance two
cites work: Labelling Graphs with a Condition at Distance 2
cites work: Graph labeling and radio channel assignment
cites work: 25 pretty graph colouring problems
cites work: A coloring problem on the \(n\)-cube
cites work: A survey on the distance-colouring of graphs
cites work: Q4301239
cites work: Hamiltonian circuits in Cayley graphs
cites work: New bounds on a hypercube coloring problem.
cites work: On a hypercube coloring problem
cites work: Q4146884
cites work: Near-optimal conflict-free channel set assignments for an optical cluster-based hypercube network
cites work: On the $\lambda$-Number of $Q_n $ and Related Graphs
cites work: Q4542184
cites work: A channel assignment problem for optical networks modelled by Cayley graphs
cites work: Labelling Cayley Graphs on Abelian Groups
cites work: Distance Labelling Problems for Hypercubes and Hamming Graphs – A Survey
DOI: 10.1016/J.DAM.2007.11.018
description: scientific article; zbMATH DE number 5526336