HIGHLIGHTS
- who: Mathematics Subject Classification et al. from the Lukhdhirji Engineering College, Morvi, , Gujarat, India have published the Article: Optimal radio labelings of graphs, in the Journal: (JOURNAL)
SUMMARY
Bantva and Liu gave a lower bound for the radio number of block graphs and three necessary and sufficient condition to achieve the lower bound. Some subgraphs of a given graph G are characterized such that if the radio number of G achieves the lower bound given then these subgraphs also achieve the lower bound. Recursively define Li+1=N (Li ) for 1 ≤ i ≤ h . . .
If you want to have access to all the content you need to log in!
Thanks :)
If you don't have an account, you can create one here.