L(j,k)-labelings of Cartesian products of three complete graphs.
From MaRDI portal
Publication:2804784
Recommendations
- Distance two labelings of Cartesian products of complete graphs.
- \(L (2,1)\)-circular labelings of Cartesian products of complete graphs
- \(L (j, k)\)- and circular \(L(j, k)\)-labellings for the products of complete graphs
- scientific article; zbMATH DE number 1439442
- \(L(j,k)\)-labeling number of Cartesian product of path and cycle
Cited in
(8)- Labeling products of complete graphs with a condition at distance two
- \(L(j,k)\)-labeling number of Cartesian product of path and cycle
- \(k\)-number of complete muti-partite graphs
- \(L(h,k)\) labelings of \(K_n-M\) and \(K_n-P_m\) for all values of \(h\) and \(k^\ast\)
- Distance two labelings of Cartesian products of complete graphs.
- \(l(3,2,1)\)-labeling for the product of a complete graph and a cycle
- New \(L(j,k)\)-labelings for direct products of complete graphs
- \(L (2,1)\)-circular labelings of Cartesian products of complete graphs
This page was built for publication: \(L(j,k)\)-labelings of Cartesian products of three complete graphs.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2804784)