Abstract
A new graph characteristic, (a,d)-total edge irregularity strength of graphs is introduced. (a,d)-edge irregular evaluations of some families of graphs has been made, upper and lower bounds of the above parameter are determined.
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 call
