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...
Saved in:
| Published in: | JURNAL ILMU DASAR Vol. 12; no. 2; pp. 148 - 151 |
|---|---|
| Main Authors: | , , |
| Format: | Journal Article |
| Language: | English |
| Published: |
Fakultas MIPA Universitas Jember
01-07-2011
|
| Subjects: | |
| Online Access: | Get full text |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | 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 the minimum value of the largest label over all such irregular assignments. In this paper, we prove that the total vertex irregularity strength of the Cocktail Party graph H2,n ,that is tvs(H2,n )= 3 for n ≥ 3. |
|---|---|
| ISSN: | 1411-5735 2442-5613 |