Distance two surjective labelling of paths and interval graphs
DOI10.1155/2021/9958077zbMATH Open1471.05095OpenAlexW3169545093MaRDI QIDQ2045355FDOQ2045355
Authors: Sk Amanathulla, G. Muhiuddin, Madhumangal Pal, Deena Al-Kadi 
Publication date: 12 August 2021
Published in: Discrete Dynamics in Nature and Society (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1155/2021/9958077
Recommendations
Graph algorithms (graph-theoretic aspects) (05C85) Coloring of graphs and hypergraphs (05C15) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)
Cites Work
- Labelling Graphs with a Condition at Distance 2
- A bound on the chromatic number of the square of a planar graph
- The \(L(3,2,1)\)-labeling problem on graphs
- Approximations for -Colorings of Graphs
- \(L(3,2,1)\)-labeling of graphs
- Coloring the square of a planar graph
- The $L(2,1)$-Labeling Problem on Graphs
- \(L(2,1)\)-labeling of interval graphs
- On the \(L(p,1)\)-labelling of graphs
- Title not available (Why is that?)
- A Theorem about the Channel Assignment Problem
- \(L(2, 1)\)-labeling of permutation and bipartite permutation graphs
- On the L(h, k)‐labeling of co‐comparability graphs and circular‐arc graphs
- A mathematical approach on representation of competitions: competition cluster hypergraphs
- \(L(0,1)\)-labelling of permutation graphs
- \(L(3, 2, 1)\)- and \(L(4, 3, 2, 1)\)-labeling problems on interval graphs
- Degree sequence of graph operator for some standard graphs
- On classes of infinite loaded graphs with randomly deleted edges
- Computation of certain topological coindices of graphene sheet and \(C_4C_8(S)\) nanotubes and nanotorus
- On graphs with equal dominating and c-dominating energy
Cited In (2)
This page was built for publication: Distance two surjective labelling of paths and interval graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2045355)
