On Distance Vertex Irregular Total k-Labeling
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 σ: T∪ S→ 1, 2,···, k, be a total k-labeling on H and w σ …
sets of vertices and edges on H. Let σ: T∪ S→ 1, 2,···, k, be a total k-labeling on H and w σ …
Total distance vertex irregularity strength of some corona product graphs.
A distance vertex irregular total k-labeling of a simple undirected graph G= G (V, E), is a
function f: V (G)∪ E (G)-→{1, 2,..., k} such that for every pair vertices u, v∈ V (G) and u ̸= v …
function f: V (G)∪ E (G)-→{1, 2,..., k} such that for every pair vertices u, v∈ V (G) and u ̸= v …
Total Distance Vertex Irregularity Strength of Hairy Cycle C_m^ n Graph
W Ida, W Dian Eka, S Sugiyarto - Journal of Data Science, 2022 - eprints.intimal.edu.my
A total graph labeling is an assignment of integers to the union of vertices and edges to
certain conditions. The labeling becomes D-distance vertex irregular total k-labeling when …
certain conditions. The labeling becomes D-distance vertex irregular total k-labeling when …
Non-inclusive and inclusive distance irregularity strength for the join product of graphs.
Abstract A function ɸ: V (G)→{1, 2,..., k} of a simple graph G is said to be a non-inclusive
distance vertex irregular k-labeling of G if the sums of labels of vertices in the open …
distance vertex irregular k-labeling of G if the sums of labels of vertices in the open …