(3,1) – total labeling of cycle, path graphs and some related graphs
Abstract
The (3,1)- total labeling of a graph G is an assignment of non- negative integers to vertices and edges of G such that no two adjacent vertices or edges have the same label and the difference of labels between a vertex and its incident edges is at least 3. In this paper, we study the (3,1)- total labeling for some types of graphs and derive their (3,1)- total labeling number.
Copyright © 2021 H. El-Zohny, S. Radwan, S. I. Abo El Fotooh, Z. Mohammed. 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
H. El-Zohny, S. Radwan, S. I. Abo El Fotooh, Z. Mohammed, (3,1) – total labeling of cycle, path graphs and some related graphs, J. Math. Comput. Sci. 11 (2021), 2501–2507. https://doi.org/10.28919/jmcs/5463
BibTeX
@article{El-Zohny2021,
author = {El-Zohny, H. and Radwan, S. and Abo El Fotooh, S. I. and Mohammed, Z.},
title = {(3,1) – total labeling of cycle, path graphs and some related graphs},
journal = {J. Math. Comput. Sci.},
volume = {11},
year = {2021},
pages = {2501--2507},
doi = {10.28919/jmcs/5463}
}