\(L(2, 1)\)-labeling of the Cartesian and strong product of two directed cycles
DOI10.3934/mfc.2018003zbMath1490.05245OpenAlexW2788681089MaRDI QIDQ2668538
Aleksander Vesel, Huiqin Jiang, Zehui Shao
Publication date: 7 March 2022
Published in: Mathematical Foundations of Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3934/mfc.2018003
Applications of graph theory (05C90) Coloring of graphs and hypergraphs (05C15) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Graph algorithms (graph-theoretic aspects) (05C85) Directed graphs (digraphs), tournaments (05C20) Graph operations (line graphs, products, etc.) (05C76)
Related Items (2)
Uses Software
Cites Work
- Upper bounds on the connection probability for 2-D meshes and tori
- Generic algorithms for some decision problems on fasciagraphs and rotagraphs
- On the domination number of the Cartesian product of the cycle of length \(n\) and any graph
- Distance-two labelings of digraphs
- \(L(p,q)\)-labeling of digraphs
- \(L(2,1)\)-labeling of strong products of cycles
- Computing graph invariants on rotagraphs using dynamic algorithm approach: The case of (2, 1)-colorings and independence numbers
- \(L(2,1)\)-labeling of direct product of paths and cycles
- \(L(2,1)\)-labeling of oriented planar graphs
- On the \(L(p,1)\)-labelling of graphs
- Exact Algorithms for L(2,1)-Labeling of Graphs
- Labelling Graphs with a Condition at Distance 2
- A Theorem about the Channel Assignment Problem
- Approximations for -Colorings of Graphs
- The $L(2,1)$-Labeling Problem on Graphs
- Automata, Languages and Programming
- Models and solution techniques for frequency assignment problems
- Fixed-parameter complexity of \(\lambda\)-labelings
- Unnamed Item
- Unnamed Item
This page was built for publication: \(L(2, 1)\)-labeling of the Cartesian and strong product of two directed cycles
