Radio secure number of a graph

DOI10.1016/J.ENDM.2016.05.023MaRDI QIDQ327660zbMATH OpenOpenAlexFDO

Authors K. N. Meera, B. Sooryanarayana

Publication date 19 October 2016

Full work available at URL https://doi.org/10.1016/j.endm.2016.05.023

zbMATH Keywords

radio labelingradio graceful graphs

Mathematics Subject Classification ID

Connectivity (05C40) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Recommendations

• Radio number of graphs with small diameter
• Radio number of ladder graphs
• scientific article; zbMATH DE number 2188457
• The radio numbers of all graphs of order \(n\) and diameter \(n-2\)
• Radio number of Hamming graphs of diameter 3

Cites work

• scientific article; zbMATH DE number 5850548 (Why is no real title available?)
• scientific article; zbMATH DE number 728185 (Why is no real title available?)
• scientific article; zbMATH DE number 2170463 (Why is no real title available?)
• scientific article; zbMATH DE number 194437 (Why is no real title available?)
• scientific article; zbMATH DE number 2188457 (Why is no real title available?)
• Multilevel Distance Labelings for Paths and Cycles
• Parallel concepts in graph theory
• Radio labeling of cube of a cycle
• Radio labelings of graphs
• Radio number for trees
• Radio number of cube of a path

This page was built for publication: Radio secure number of a graph

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