L(2, 1)-labeling of permutation and bipartite permutation graphs

DOI10.1007/S11786-014-0180-2zbMATH Open1310.05204OpenAlexW2139490156MaRDI QIDQ2018666FDOQ2018666

Satyabrata Paul, Madhumangal Pal, Anita Pal

Publication date: 25 March 2015

Published in: Mathematics in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11786-014-0180-2

Recommendations

• The \(L(3, 2, 1)\)-labelings of bipartite permutation graphs
• \(L(0,1)\)-labelling of permutation graphs
• \(L(2,1)\)-labeling of perfect elimination bipartite graphs
• scientific article; zbMATH DE number 5972537
• Labeling bipartite permutation graphs with a condition at distance two
• The \(L(3,2,1)\)-labeling on bipartite graphs
• The \(L(2,1)\)-labeling on total graphs of complete multipartite graphs
• scientific article; zbMATH DE number 2073985
• \(L(2,1)\)-labelings on the composition of \(n\) graphs
• \(L(2, 1)\)-labeling of circulant graphs

zbMATH Keywords

permutation graphs\(L(21)\)-labelingbipartite permutation graphs

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10)

Cites Work

• Algorithmic graph theory and perfect graphs
• \(T\)-colorings of graphs: recent results and open problems
• Labelling Graphs with a Condition at Distance 2
• Bipartite permutation graphs
• A survey on labeling graphs with a condition at distance two
• \(L(h,1)\)-labeling subclasses of planar graphs
• A Linear Recognition Algorithm for Cographs
• Approximations for  -Colorings of Graphs
• The $L(2,1)$-Labeling Problem on Graphs
• Bipartite permutation graphs with application to the minimum buffer size problem
• The \(L(2,1)\)-labeling of unigraphs
• Title not available (Why is that?)
• Selection of programme slots of television channels for giving advertisement: a graph theoretic approach
• Fixed-parameter complexity of \(\lambda\)-labelings
• On the \(L(p,1)\)-labelling of graphs
• Labeling Chordal Graphs: Distance Two Condition
• A Theorem about the Channel Assignment Problem
• Title not available (Why is that?)
• A Linear Time Algorithm for L(2,1)-Labeling of Trees
• Labeling bipartite permutation graphs with a condition at distance two
• \(L(2,1)\)-labeling of perfect elimination bipartite graphs
• On \(L(2,1)\)-coloring split, chordal bipartite, and weakly chordal graphs
• On the L(h, k)‐labeling of co‐comparability graphs and circular‐arc graphs
• On theL(2, 1)-labelling of block graphs
• Linear structure of bipartite permutation graphs and the longest path problem

Cited In (10)

• Characterization of 2-path signed network
• 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)\)-labeling of interval graphs
• \(L(0,1)\)-labelling of permutation graphs
• The radio \(k\)-chromatic number for the corona of arbitrary graph and \(K_1\)
• L(2,1,1)-labeling of interval graphs
• L(3,2,1)-Labeling problems on trapezoid graphs
• DISTANCE TWO LABELING ON THE SQUARE OF A CYCLE
• \(L(3, 2, 1)\)-labeling problem of square of path

This page was built for publication: \(L(2, 1)\)-labeling of permutation and bipartite permutation graphs

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