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: | , , |
|---|---|
| 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 |
| id |
doaj-7f43838cff47401b93f3f2d3b9b49dbc |
|---|---|
| record_format |
Article |
| spelling |
doaj-7f43838cff47401b93f3f2d3b9b49dbc2020-11-25T02:21:30ZengFakultas MIPA Universitas JemberJurnal Ilmu Dasar1411-57352442-56132011-07-0112214815161On Total Vertex Irregularity Strength of Cocktail Party GraphKristiana WijayaS SlaminMirka MillerA 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.https://jurnal.unej.ac.id/index.php/JID/article/view/61total vertex irregularity strengthcocktail party graph |
| collection |
DOAJ |
| language |
English |
| format |
Article |
| sources |
DOAJ |
| author |
Kristiana Wijaya S Slamin Mirka Miller |
| spellingShingle |
Kristiana Wijaya S Slamin Mirka Miller On Total Vertex Irregularity Strength of Cocktail Party Graph Jurnal Ilmu Dasar total vertex irregularity strength cocktail party graph |
| author_facet |
Kristiana Wijaya S Slamin Mirka Miller |
| author_sort |
Kristiana Wijaya |
| title |
On Total Vertex Irregularity Strength of Cocktail Party Graph |
| title_short |
On Total Vertex Irregularity Strength of Cocktail Party Graph |
| title_full |
On Total Vertex Irregularity Strength of Cocktail Party Graph |
| title_fullStr |
On Total Vertex Irregularity Strength of Cocktail Party Graph |
| title_full_unstemmed |
On Total Vertex Irregularity Strength of Cocktail Party Graph |
| title_sort |
on total vertex irregularity strength of cocktail party graph |
| publisher |
Fakultas MIPA Universitas Jember |
| series |
Jurnal Ilmu Dasar |
| issn |
1411-5735 2442-5613 |
| publishDate |
2011-07-01 |
| description |
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. |
| topic |
total vertex irregularity strength cocktail party graph |
| url |
https://jurnal.unej.ac.id/index.php/JID/article/view/61 |
| work_keys_str_mv |
AT kristianawijaya ontotalvertexirregularitystrengthofcocktailpartygraph AT sslamin ontotalvertexirregularitystrengthofcocktailpartygraph AT mirkamiller ontotalvertexirregularitystrengthofcocktailpartygraph |
| _version_ |
1724865708239618048 |