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.
Published Version
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have