Radio k-labeling of paths

DOI10.15672/HUJMS.573315MaRDI QIDQ5164256zbMATH OpenOpenAlexFDO

Authors Laxman Saha, Satyabrata Das, Kalishankar Tiwary, Kinkar Ch. Das

Publication date 10 November 2021

Published in Hacettepe Journal of Mathematics and Statistics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.15672/hujms.573315

zbMATH Keywords

channel assignmentradio \(k\)-chromatic numberradio \(k\)-labelingspan

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 7725444
• Radio k-colorings of paths
• Radio labelings of distance graphs
• Linear and cyclic radio k-labelings of trees
• A new graph radio k-coloring algorithm

Cites work

• A channel assignment problem for optical networks modelled by Cayley graphs
• A distance-labelling problem for hypercubes
• A graph radio k-coloring algorithm
• A lower bound for radio \(k\)-chromatic number
• A note on radio antipodal colourings of paths.
• Antipodal labelings for cycles.
• Distance-two labellings of Hamming graphs
• Graph labeling and radio channel assignment
• Graph labellings with variable weights, a survey
• scientific article; zbMATH DE number 5850548 (Why is no real title available?)
• scientific article; zbMATH DE number 2154968 (Why is no real title available?)
• scientific article; zbMATH DE number 2170463 (Why is no real title available?)
• scientific article; zbMATH DE number 2188457 (Why is no real title available?)
• Labeling products of complete graphs with a condition at distance two
• Labelling Cayley Graphs on Abelian Groups
• Labelling Graphs with a Condition at Distance 2
• Linear and cyclic radio k-labelings of trees
• Multilevel Distance Labelings for Paths and Cycles
• Nearly antipodal chromatic number ac'(P_n) of the path P_n.
• On characterizing radio k-coloring problem by path covering problem
• On radio \((n-4)\)-chromatic number of the path \(P_n\)
• On the radio number of toroidal grids
• Optimal radio labellings of complete m-ary trees
• Radio antipodal colorings of cycles
• Radio k-colorings of paths
• Radio labelings of graphs
• Radio number for trees
• Radio numbers for generalized prism graphs
• Real Number Graph Labellings with Distance Conditions
• The $L(2,1)$-Labeling Problem on Graphs
• The Channel Assignment Problem with Variable Weights
• The radio antipodal and radio numbers of the hypercube.
• The radio number of \(C_n\square C_n\).
• Upper bounds on the radio number of some trees

Cited in

(10)

• Antipodal number of full \(m\)-ary trees
• Radio \(k\)-chromatic number of full \(m\)-ary trees
• Radio k-labelings for Cartesian products of graphs
• A new graph radio k-coloring algorithm
• Radio k-colorings of paths
• On characterizing radio k-coloring problem by path covering problem
• Relationship between radio \(k\)-chromatic number of graphs and square graphs
• scientific article; zbMATH DE number 7725444 (Why is no real title available?)
• On radio k-labeling of the power of the infinite path
• A different approach for multi-level distance labellings of path structure networks

This page was built for publication: Radio \(k\)-labeling of paths

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