Abstract
Objectives: To explore the least upper bound of graphs by radio contra harmonic labeling. Methods: Contra harmonic mean function or , radio mean labeling condition and radio harmonic mean labeling are used. Findings: Here we introduce radio contra harmonic mean labeling and its least upper bound, designated as radio contra harmonic mean number, by formulating the constraints. Novelty: Based on radio mean labeling and contra harmonic mean labeling, the new concept of radio contra harmonic mean labeling was established. The bounds of some special graphs are encountered here. This kind of labeling is employed in secure communication networks and is also applicable in X-rays, crystallography, coding theory, computing etc. Keywords: Radio contra harmonic mean labeling, rchmn (G), Order, Diameter, Smallest span
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
