(a,d)-total edge irregularity strength of graphs
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.
Copyright © 2021 K. Muthugurupackiam, R. Padmapriya. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
Cite this article
K. Muthugurupackiam, R. Padmapriya, (a,d)-total edge irregularity strength of graphs, J. Math. Comput. Sci. 11 (2021), 4436–4453. https://doi.org/10.28919/jmcs/5886
BibTeX
@article{Muthugurupackiam2021,
author = {Muthugurupackiam, K. and Padmapriya, R.},
title = {(a,d)-total edge irregularity strength of graphs},
journal = {J. Math. Comput. Sci.},
volume = {11},
year = {2021},
pages = {4436--4453},
doi = {10.28919/jmcs/5886}
}