Distance two labeling on the square of a cycle
From MaRDI portal
Publication:5217048
Recommendations
Cites work
- A survey on labeling graphs with a condition at distance two
- Graph labeling and radio channel assignment
- Labelling Graphs with a Condition at Distance 2
- Optimal \(L(h,k)\)-labeling of regular grids
- Real Number Graph Labellings with Distance Conditions
- Relating path coverings to vertex labellings with a condition at distance two
- Tension polynomials of graphs
- The $L(2,1)$-Labeling Problem on Graphs
- The L(2,1)-labeling and operations of graphs
- The \(L(2,1)\)-labeling on planar graphs
- The L(2,1)-labelling of trees
- The edge span of distance two labellings of graphs
- The minimum span of \(L(2,1)\)-labelings of generalized flowers
- \(L(2, 1)\)-labeling of permutation and bipartite permutation graphs
- \(L(2,1)\)-labeling of strong products of cycles
- \(L(h,1)\)-labeling subclasses of planar graphs
- \(L(h,k)\)-labelings of Hamming graphs
- \(L(p,q)\)-labeling and integer tension of a graph embedded on torus
Cited in
(2)
This page was built for publication: Distance two labeling on the square of a cycle
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5217048)