Abstract
A Radio Gd-distance labeling of a connected graph G is an injective map f from the vertex set V(G) to ℕ such that for two distinct vertices u and v of G,
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
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 callMore From: international journal of mathematics and computer research
Paper Title
Journal
Date
