Cube-magic labelings of grids.

MaRDI QIDQ5033181zbMATH OpenFDO

Authors Thomas Kalinowski, Rachel Wulan Nirmalasari Wijaya, Joe Ryan

Publication date 22 February 2022

Full work available at URL https://arxiv.org/abs/1702.02639

zbMATH Keywords

\(H\)-magic labelingCartesian product of pathsgraph labelinggrid graph

Mathematics Subject Classification ID

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

Abstract: We show that the vertices and edges of a $d$-dimensional grid graph $G=(V,E)$ ($dgeqslant2$) can be labeled with the integers from $1,ldots,lvertVvert$ and $1,ldots,lvertEvert$, respectively, in such a way that for every subgraph $H$ isomorphic to a $d$-cube the sum of all the labels of $H$ is the same. As a consequence, for every $dgeqslant2$, every $d$-dimensional grid graph is $Q_d$-supermagic where $Q_d$ is the $d$-cube.

Recommendations

• scientific article; zbMATH DE number 6119645
• On supermagic regular graphs
• scientific article; zbMATH DE number 5178693
• D-magic labelings of the folded n-cube
• Super (a,1)-cycle-antimagic labeling of the grid.

Cited in

(2)

• On a dispersion problem in grid labeling
• scientific article; zbMATH DE number 4095516 (Why is no real title available?)

This page was built for publication: Cube-magic labelings of grids.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5033181)