(3,1) – total labeling of cycle, path graphs and some related graphs

H. El-Zohny, S. Radwan, S. I. Abo El Fotooh, Z. Mohammed

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.

Full Text: PDF

Published: 2021-03-30

How to 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

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.

J. Math. Comput. Sci.

ISSN: 1927-5307

Editorial Office: jmcs@scik.org

 

Copyright ©2021 JMCS