\(L(0,1)\)-labelling of permutation graphs

DOI10.1007/S10852-015-9280-5zbMath1326.05135OpenAlexW1989068151MaRDI QIDQ894561

Satyabrata Paul, Anita Pal, Madhumangal Pal

Publication date: 1 December 2015

Published in: Journal of Mathematical Modelling and Algorithms in Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10852-015-9280-5

zbMATH Keywords

frequency assignment problempermutation graph\(L(0,1)\)-labelling

Mathematics Subject Classification ID

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

Related Items (3)

L(2,1,1)-labeling of interval graphs ⋮ Distance two surjective labelling of paths and interval graphs ⋮ L(3,2,1)-Labeling problems on trapezoid graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• \(L(2,1)\)-labeling of interval graphs
• Bipartite permutation graphs with application to the minimum buffer size problem
• An efficient algorithm to find next-to-shortest path on permutation graphs
• Bipartite permutation graphs
• An optimal algorithm to solve the all-pairs shortest paths problem on permutation graphs
• Distance-two labelings of graphs
• \(L(h,1)\)-labeling subclasses of planar graphs
• Algorithmic graph theory and perfect graphs
• \(L(2, 1)\)-labeling of permutation and bipartite permutation graphs
• Labelling of some planar graphs with a condition at distance two
• On the \(L(p,1)\)-labelling of graphs
• A survey on labeling graphs with a condition at distance two
• An efficient PRAM algorithm for maximum-weight independent set on permutation graphs
• Labelling Graphs with a Condition at Distance 2
• A parallel algorithm to generate all maximal independent sets on permutation graphs
• Optimal Sequential And Parallel Algorithms To Compute A Steiner Tree On Permutation Graphs
• Maximum weightk-independent set problem on permutation graphs
• Approximations for  -Colorings of Graphs

This page was built for publication: \(L(0,1)\)-labelling of permutation graphs