Labelling Cayley Graphs on Abelian Groups

DOI10.1137/S0895480102404458zbMath1103.05080OpenAlexW1986927051MaRDI QIDQ5470805

Sanming Zhou

Publication date: 1 June 2006

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/s0895480102404458

zbMATH Keywords

hypercubeHamming graphchannel assignmentradio chromatic number\(L(j,k)\)-labelling

Mathematics Subject Classification ID

Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Related Items (21)

A channel assignment problem for optical networks modelled by Cayley graphs ⋮ \(L(2, 1)\)-labeling of circulant graphs ⋮ Radio-\(k\)-labeling of cycles for large \(k\) ⋮ L(3,1)-labeling of circulant graphs ⋮ No-hole 2-distant colorings for Cayley graphs on finitely generated abelian groups ⋮ Distance labellings of Cayley graphs of semigroups ⋮ The \(L(2,1)\)-labelling problem for cubic Cayley graphs on dihedral groups ⋮ Path covering number and \(L(2,1)\)-labeling number of graphs ⋮ Distance-constrained labellings of Cartesian products of graphs ⋮ Channel assignment on Cayley graphs ⋮ Radio $k$-labeling of paths ⋮ Optimal radio labellings of complete \(m\)-ary trees ⋮ The \(L(h,1,1)\)-labelling problem for trees ⋮ On the construction of all shortest vertex-disjoint paths in Cayley graphs of abelian groups ⋮ Lambda number of the power graph of a finite group ⋮ A distance-labelling problem for hypercubes ⋮ Linear and cyclic distance-three labellings of trees ⋮ Silver cubes ⋮ \(L(h,k)\)-labelings of Hamming graphs ⋮ Distance-two labellings of Hamming graphs ⋮ Distance Labelling Problems for Hypercubes and Hamming Graphs – A Survey

This page was built for publication: Labelling Cayley Graphs on Abelian Groups