A different approach for multi-level distance labellings of path structure networks

DOI10.5556/J.TKJM.55.2024.3913zbMATH Open1537.05029MaRDI QIDQ6544864

Mosaddek Hossain, Kalishankar Tiwary, Laxman Saha

Publication date: 27 May 2024

Published in: Tamkang Journal of Mathematics (Search for Journal in Brave)

zbMATH Keywords

frequency assignment problemspanradio \(k\)-chromatic numberradio \(k\)-coloring

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Distance in graphs (05C12) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• On radio \((n-4)\)-chromatic number of the path \(P_n\)
• Graph labellings with variable weights, a survey
• Radio number for trees
• Labeling products of complete graphs with a condition at distance two
• Radio antipodal colorings of cycles
• Radio labelings of graphs
• Real Number Graph Labellings with Distance Conditions
• Nearly antipodal chromatic number $ac'(P_n)$ of the path $P_n$
• Labelling Graphs with a Condition at Distance 2
• Radio k-colorings of paths
• Multilevel Distance Labelings for Paths and Cycles

This page was built for publication: A different approach for multi-level distance labellings of path structure networks

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