The radio number of (Wn: 2) graphs

DOI10.1080/09720529.2009.10698268zbMATH Open1208.05133OpenAlexW2053649869MaRDI QIDQ3574296FDOQ3574296

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

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

zbMATH Keywords

radio labelingradio number

Mathematics Subject Classification ID

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

Cites Work

• Multilevel Distance Labelings for Paths and Cycles

Cited In (7)

• Multi-level distance labelings for helm graphs.
• Title not available (Why is that?)
• RADIO NUMBER OF TRANSFORMATION GRAPHS OF A PATH
• Radio graceful Hamming graphs
• Title not available (Why is that?)
• Radio number of some wheel related graphs
• Radio number for some thorn 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)