\(L(2,1)\)-labeling for subdivisions of cycle dominated graphs

zbMath1393.05233MaRDI QIDQ1653937

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

zbMATH Keywords

channel assignmentdistance two labelingdouble fantransmitters

Mathematics Subject Classification ID

Distance in graphs (05C12) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Cites Work

• On the \(L(p,1)\)-labelling of graphs
• A survey on labeling graphs with a condition at distance two
• Labelling Graphs with a Condition at Distance 2
• A Theorem about the Channel Assignment Problem
• The $L(2,1)$-Labeling Problem on Graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: \(L(2,1)\)-labeling for subdivisions of cycle dominated graphs