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

DOI10.5556/J.TKJM.55.2024.3913MaRDI QIDQ6544864zbMATH OpenFDO

Authors Laxman Saha, Mosaddek Hossain, Kalishankar Tiwary

Publication date 27 May 2024

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

zbMATH Keywords

spanradio \(k\)-chromatic numberradio \(k\)-coloringfrequency assignment problem

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 7725444
• Radio \(k\)-labeling of paths
• Radio k-colorings of paths
• New results on radio \(k\)-labelings of distance graphs
• Radio \(k\)-chromatic number of full \(m\)-ary trees

Cites work

• scientific article; zbMATH DE number 2154968 (Why is no real title available?)
• A note on radio antipodal colourings of paths.
• Graph labellings with variable weights, a survey
• Labeling products of complete graphs with a condition at distance two
• Labelling Graphs with a Condition at Distance 2
• Multilevel Distance Labelings for Paths and Cycles
• Nearly antipodal chromatic number \(ac'(P_n)\) of the path \(P_n\).
• On radio \((n-4)\)-chromatic number of the path \(P_n\)
• Radio antipodal colorings of cycles
• Radio k-colorings of paths
• Radio labelings of graphs
• Radio number for trees
• Real Number Graph Labellings with Distance Conditions
• The radio antipodal and radio numbers of the hypercube.

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)