Distance two surjective labelling of paths and interval graphs
From MaRDI portal
Publication:2045355
DOI10.1155/2021/9958077zbMath1471.05095OpenAlexW3169545093MaRDI QIDQ2045355
Madhumangal Pal, Sk Amanathulla, G. Muhiuddin, 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
Coloring of graphs and hypergraphs (05C15) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (2)
Certain concepts of interval-valued intuitionistic fuzzy graphs with an application ⋮ A novel study of graphs based on \(m\)-polar cubic structures
Cites Work
- Unnamed Item
- Unnamed Item
- \(L(3,2,1)\)-labeling of graphs
- \(L(2,1)\)-labeling of interval 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
- \(L(2, 1)\)-labeling of permutation and bipartite permutation graphs
- On the \(L(p,1)\)-labelling of graphs
- A bound on the chromatic number of the square of a planar graph
- 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
- Labelling Graphs with a Condition at Distance 2
- A Theorem about the Channel Assignment Problem
- Approximations for -Colorings of Graphs
- Coloring the square of a planar graph
- The $L(2,1)$-Labeling Problem on Graphs
- On the L(h, k)‐labeling of co‐comparability graphs and circular‐arc graphs
This page was built for publication: Distance two surjective labelling of paths and interval graphs
