L(0,1)-labelling of permutation graphs

DOI10.1007/S10852-015-9280-5MaRDI QIDQ894561zbMATH OpenOpenAlexFDO

Authors Satyabrata Paul, Madhumangal Pal, Anita 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

permutation graphfrequency assignment problem\(L(0,1)\)-labelling

Mathematics Subject Classification ID

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

Recommendations

• \(L(2, 1)\)-labeling of permutation and bipartite permutation graphs
• The L(3, 2, 1)-labelings of bipartite permutation graphs
• An efficient algorithm to solve \(L(0,1)\)-labelling problem on interval graphs
• Labeling bipartite permutation graphs with a condition at distance two
• On the \(L(p,1)\)-labelling of graphs

Cites work

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

Cited in

(8)

• \(L(2, 1)\)-labeling of permutation and bipartite permutation graphs
• On L(2,1)-coloring split permutation graphs
• L(3,2,1)-labeling problems on trapezoid graphs
• Minimization of span in \(L(3,1)\)-labeling for a particular type of intersection graphs
• Distance two surjective labelling of paths and interval graphs
• L(2,1,1)-labeling of interval graphs
• An efficient algorithm to solve \(L(0,1)\)-labelling problem on interval graphs
• L(3, 2, 1)-labeling problem of square of path

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q894561)