L(j,k)-labeling number of Cartesian product of path and cycle
From MaRDI portal
Publication:5963640
Recommendations
Cites work
- scientific article; zbMATH DE number 2191985 (Why is no real title available?)
- scientific article; zbMATH DE number 2197889 (Why is no real title available?)
- A survey on labeling graphs with a condition at distance two
- Circular Distance Two Labeling and the $\lambda$-Number for Outerplanar Graphs
- Circular \(L(j,k)\)-labeling number of direct product of path and cycle
- Circular chromatic number: A survey
- Circular colorings of edge-weighted graphs
- Efficient distributions of arms‐control inspection effort
- Graph theory with applications
- Hamiltonicity and circular distance two labellings
- Labeling trees with a condition at distance two
- Recent progress in mathematics and engineering on optimal graph labellings with distance conditions
- \(L (j, k)\)- and circular \(L(j, k)\)-labellings for the products of complete graphs
- \(L(j, k)\)-number of direct product of path and cycle
Cited in
(8)- On \(L(d,1)\)-labeling of Cartesian product of a cycle and a path
- \(L(2,1)\)-labelings of the local-edge-path-replacements of Cartesian products
- \(L(j, k)\)-number of direct product of path and cycle
- \(L(j,k)\)-labeling numbers of square of paths
- scientific article; zbMATH DE number 5811332 (Why is no real title available?)
- \(L(j,k)\)-labelings of Cartesian products of three complete graphs.
- The \(H\)-force number of the Cartesian product of a cycle with a path
- Circular \(L(j,k)\)-labeling number of direct product of path and cycle
This page was built for publication: \(L(j,k)\)-labeling number of Cartesian product of path and cycle
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5963640)