The radio number of (Wn: 2) graphs

DOI10.1080/09720529.2009.10698268MaRDI QIDQ3574296zbMATH OpenOpenAlexFDO

Authors R. Sweetly, J. Paulraj Joseph

Publication date 9 July 2010

Published in Journal of Discrete Mathematical Sciences and Cryptography (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/09720529.2009.10698268

zbMATH Keywords

radio labelingradio number

Mathematics Subject Classification ID

Distance in graphs (05C12) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Recommendations

• The radio numbers of all graphs of order n and diameter n-2
• On the radio number of square of graphs
• A lower bound for the radio number of graphs
• Radio number of graphs with small diameter
• Radio antipodal number of certain graphs
• The radio number of edge-joint graphs.
• On bounds of radio number of certain product graphs
• The radio number for wedge sum of graphs.
• On radio mean number of some graphs
• Radio number of graphs of diameter three

Cites work

• Multilevel Distance Labelings for Paths and Cycles

Cited in

(9)

• Radio number for some thorn graphs
• Radio graceful Hamming graphs
• Radio number of some wheel related graphs
• Multi-level distance labelings for helm graphs.
• The radio number for wedge sum of graphs.
• scientific article; zbMATH DE number 6723768 (Why is no real title available?)
• RADIO NUMBER OF TRANSFORMATION GRAPHS OF A PATH
• scientific article; zbMATH DE number 6470676 (Why is no real title available?)
• Further results on radio number of wedge sum of graphs.

This page was built for publication: The radio number of (W_n: 2) graphs

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