On Distance Vertex Irregular Total k-Labeling

0Citations
Citations of this article
8Readers
Mendeley users who have this article in their library.

Abstract

Let H= (T,S), be a finite simple graph, T(H)= T and S(H)= S, respectively, are the sets of vertices and edges on H. Let sigama:T∪S→1,2,• • •,k, be a total k-labeling on H and wsigama (x), be a weight of xT while using sigama labeling, which is evaluated based on the total number of all vertices labels in the neighborhood x and its incident edges. If every xT has a different weight, then sigama is a distance vertex irregular total k-labeling (DVITL). Total distance vertex irregularity strength of H (tdis(H) is defined as the least k for which H has a DVITL. Our research investigates the DVITL of the path (Pr) and cycle (Cr) graphs. We establish a lower bound and then calculate the precise value of tdis(Pr) and tdis(Cr).

Cite

CITATION STYLE

APA

Wijayanti, D. E., Hidayat, N., Indriati, D., Alghofari, A. R., & Slamin. (2023). On Distance Vertex Irregular Total k-Labeling. Science and Technology Indonesia, 8(3), 479–485. https://doi.org/10.26554/sti.2023.8.3.479-485

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free