L(3,2,1)-Labeling problems on trapezoid graphs

DOI10.1142/S1793830921500683zbMath1478.05123OpenAlexW3109916652MaRDI QIDQ5025142

Sk Amanathulla, Madhumangal Pal

Publication date: 1 February 2022

Published in: Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s1793830921500683

zbMATH Keywords

trapezoid graphfrequency assignment\(L321\)-labeling

Mathematics Subject Classification ID

Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Related Items (1)

L(2,1,1)-labeling of interval graphs

Cites Work

• Unnamed Item
• Unnamed Item
• \(L(3,2,1)\)-labeling of graphs
• \(L(2,1)\)-labeling of interval graphs
• \(l(3,2,1)\)-labeling for the product of a complete graph and a cycle
• \(L(0,1)\)-labelling of permutation graphs
• \(T\)-colorings of graphs: recent results and open problems
• \(L(3, 2, 1)\)- and \(L(4, 3, 2, 1)\)-labeling problems on interval graphs
• \(L(2, 1)\)-labeling of permutation and bipartite permutation graphs
• Approximate L(δ₁,δ₂,…,δ_t)‐coloring of trees and interval graphs
• Labelling Graphs with a Condition at Distance 2
• On the L(h, k)‐labeling of co‐comparability graphs and circular‐arc graphs

This page was built for publication: L(3,2,1)-Labeling problems on trapezoid graphs