L(2,1)-labeling for subdivisions of cycle dominated graphs
From MaRDI portal
Publication:1653937
zbMATH Open1393.05233MaRDI QIDQ1653937FDOQ1653937
Authors: Muthali Murugan
Publication date: 7 August 2018
Published in: Bulletin of Computational Applied Mathematics (Search for Journal in Brave)
Full work available at URL: http://drive.google.com/open?id=0B5GyVVQ6O030cWRXLWMyMnRRMnM
Recommendations
- \(L(2,1)\)-labelings of subdivisions of graphs
- \( L ( p , q )\)-labelings of subdivisions of graphs
- scientific article; zbMATH DE number 5583498
- \(L(2, 1)\)-labeling of circulant graphs
- \((2,1)\)-total labeling of a class of subcubic graphs
- scientific article; zbMATH DE number 5973500
- scientific article; zbMATH DE number 2073985
- scientific article; zbMATH DE number 2091962
- \(L(2,1)\)-labeling of graphs: known results and open problems
- \(L(2,1)\)-labelings on the composition of \(n\) graphs
Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Distance in graphs (05C12) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)
Cites Work
- Graph theory
- Labelling Graphs with a Condition at Distance 2
- A survey on labeling graphs with a condition at distance two
- The $L(2,1)$-Labeling Problem on Graphs
- On the \(L(p,1)\)-labelling of graphs
- A Theorem about the Channel Assignment Problem
- \(L(2,1)\)-labeling in the context of some graph operations
- Title not available (Why is that?)
Cited In (4)
This page was built for publication: \(L(2,1)\)-labeling for subdivisions of cycle dominated graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1653937)