L(3,1)-labeling of circulant graphs
From MaRDI portal
Publication:5063266
DOI10.1142/S1793830921500932zbMath1482.05287OpenAlexW3139402528MaRDI QIDQ5063266
Publication date: 17 March 2022
Published in: Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s1793830921500932
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- \(L(2,1)\)-labeling of dually chordal graphs and strongly orderable graphs
- Labeling bipartite permutation graphs with a condition at distance two
- \(L(2, 1)\)-labeling of circulant graphs
- A channel assignment problem for optical networks modelled by Cayley graphs
- On \(L(2,1)\)-labeling of generalized Petersen graphs
- The \(L(2,1)\)-labelling problem for cubic Cayley graphs on dihedral groups
- On the \(L(p,1)\)-labelling of graphs
- A survey on labeling graphs with a condition at distance two
- Channel assignment on Cayley graphs
- $L(2,1)$-Labeling of Hamiltonian graphs with Maximum Degree 3
- A Linear Time Algorithm for L(2,1)-Labeling of Trees
- Labelling Graphs with a Condition at Distance 2
- Labeling Chordal Graphs: Distance Two Condition
- Approximations for -Colorings of Graphs
- The L(2,1)-labeling and operations of graphs
- The $L(2,1)$-Labeling Problem on Graphs
- On the L(h, k)‐labeling of co‐comparability graphs and circular‐arc graphs
- Labelling Cayley Graphs on Abelian Groups
This page was built for publication: L(3,1)-labeling of circulant graphs
