On Total Vertex Irregularity Strength of Cocktail Party Graph
A vertex irregular total k-labeling of a graph G is a function λ from both the vertex and the edge sets to {1,2,3,,k} such that for every pair of distinct vertices u and x, λ(u)+∑λ(uv)≠λ(x)+∑λ(xy). uv∈E xy∈E. The integer k is called the total vertex irregularity strength, denoted by tvs (G ) , is t...
Main Authors: | Kristiana Wijaya, S Slamin, Mirka Miller |
---|---|
Format: | Article |
Language: | English |
Published: |
Fakultas MIPA Universitas Jember
2011-07-01
|
Series: | Jurnal Ilmu Dasar |
Subjects: | |
Online Access: | https://jurnal.unej.ac.id/index.php/JID/article/view/61 |
Similar Items
-
Computation of Total Vertex Irregularity Strength of Theta Graphs
by: Ali N. A. Koam, et al.
Published: (2019-01-01) -
On inclusive distance vertex irregular labelings
by: Martin Baca, et al.
Published: (2018-04-01) -
Eccentric Digraph of Cocktail Party Graph and Hypercube
by: Tri Atmojo Kusmayadi, et al.
Published: (2011-11-01) -
Total vertex irregularity strength of trees with maximum degree five
by: S. Susilawati, et al.
Published: (2018-10-01) -
Local Inclusive Distance Vertex Irregular Graphs
by: Kiki Ariyanti Sugeng, et al.
Published: (2021-07-01)