L(2, 1)-labeling of the Cartesian and strong product of two directed cycles
From MaRDI portal
Publication:2668538
Recommendations
- scientific article; zbMATH DE number 1792593
- On L(d,1)-labelings of the Cartesian product of two cycles.
- Optimal L(2, 1)-labeling of strong products of cycles [transmitter frequency assignment]
- Distance constrained labelings of strong product of n general graphs.
- Optimal L(2,1)-labeling of Cartesian products of cycles, with an application to independent domination
Cites work
- 2-dipath and oriented L(2, 1)-labelings of some families of oriented planar graphs
- \(L(2,1)\)-labeling of direct product of paths and cycles
- \(L(2,1)\)-labeling of oriented planar graphs
- \(L(2,1)\)-labeling of strong products of cycles
- \(L(p,q)\)-labeling of digraphs
- A Theorem about the Channel Assignment Problem
- Approximations for -Colorings of Graphs
- Automata, Languages and Programming
- Computing graph invariants on rotagraphs using dynamic algorithm approach: The case of (2, 1)-colorings and independence numbers
- Distance-two labelings of digraphs
- Exact Algorithms for L(2,1)-Labeling of Graphs
- Fixed-parameter complexity of \(\lambda\)-labelings
- Generic algorithms for some decision problems on fasciagraphs and rotagraphs
- scientific article; zbMATH DE number 2197903 (Why is no real title available?)
- Labelling Graphs with a Condition at Distance 2
- Models and solution techniques for frequency assignment problems
- On the \(L(p,1)\)-labelling of graphs
- On the domination number of the Cartesian product of the cycle of length n and any graph
- The $L(2,1)$-Labeling Problem on Graphs
- Upper bounds on the connection probability for 2-D meshes and tori
Cited in
(11)- On \(L(2,1)\)-labelings of some products of oriented cycles
- Optimal \(L(d,1)\)-labelings of certain direct products of cycles and Cartesian products of cycles
- Optimal L(2,1)-labeling of Cartesian products of cycles, with an application to independent domination
- L(2, 1)-labellings for direct products of a triangle and a cycle
- Distance constrained labelings of strong product of n general graphs.
- Optimal L(2, 1)-labeling of strong products of cycles [transmitter frequency assignment]
- scientific article; zbMATH DE number 1792593 (Why is no real title available?)
- Exact square coloring of graphs resulting from some graph operations and products
- Injective edge coloring of some standard graph products
- Tight bounds on odd chromatic number of some standard graph products
- Labeling amalgamations of Cartesian products of complete graphs with a condition at distance two
This page was built for publication: \(L(2, 1)\)-labeling of the Cartesian and strong product of two directed cycles
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2668538)
