Notes on L(1,1) and L(2,1) labelings for n-cube
From MaRDI portal
Publication:489710
DOI10.1007/S10878-012-9568-6zbMATH Open1331.90092OpenAlexW2045359810MaRDI QIDQ489710FDOQ489710
Authors: Wai Chee Shiu, P. C. B. Lam, Haiying Zhou
Publication date: 21 January 2015
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-012-9568-6
Recommendations
- The \((d,1)\)-total labelling of the cube of cycles
- On irreducible no-hole \(L(2, 1)\)-labelings of hypercubes and triangular lattices
- \(L(1, 2)\)-edge-labelings for lattices
- The \(L(2,1)\)-labelling problem for cubic Cayley graphs on dihedral groups
- On \(L(k, k - 1, \ldots, 1)\) labeling of triangular lattice
- A note on the \(L (2, 1)\)-labelling problem of \(\mathcal{G} (k, m)\)
- \(\Theta\)-graceful labelings of partial cubes
- \(D\)-magic labelings of the halved \(n\)-cube
- \(L(1, 2)\)-labeling numbers on square of cycles
- On oriented \(L(p,1)\)-labeling
Cites Work
- Graph theory with applications
- Labelling Graphs with a Condition at Distance 2
- On the $\lambda$-Number of $Q_n $ and Related Graphs
- On \(L(d,1)\)-labelings of graphs
- List \(T\)-colorings of graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Pair Labellings with Given Distance
- Further Results on T-Coloring and Frequency Assignment Problems
Cited In (2)
This page was built for publication: Notes on \(L(1,1)\) and \(L(2,1)\) labelings for \(n\)-cube
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q489710)