ON THE TOTAL IRREGULARITY STRENGTH OF CYCLES AND PATHS
The vertex irregular total labeling and the edge irregular total labeling were introduced by Baca, Jendrol, Miller, and Ryan in (4). Combining both of these notions, in this paper we introduce a new irregular total labeling, called totally irregular total labeling which is required to be both vertex...
Saved in:
| Main Author: | |
|---|---|
| Format: | Theses |
| Language: | Indonesia |
| Online Access: | https://digilib.itb.ac.id/gdl/view/15244 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Institution: | Institut Teknologi Bandung |
| Language: | Indonesia |
| id |
id-itb.:15244 |
|---|---|
| spelling |
id-itb.:152442017-09-27T14:41:42ZON THE TOTAL IRREGULARITY STRENGTH OF CYCLES AND PATHS CORAZON MARZUKI (NIM: 20110008), CORRY Indonesia Theses INSTITUT TEKNOLOGI BANDUNG https://digilib.itb.ac.id/gdl/view/15244 The vertex irregular total labeling and the edge irregular total labeling were introduced by Baca, Jendrol, Miller, and Ryan in (4). Combining both of these notions, in this paper we introduce a new irregular total labeling, called totally irregular total labeling which is required to be both vertex and edge irregular. <br /> <br /> <br /> <br /> <br /> <br /> <br /> <br /> <br /> <br /> <br /> <br /> <br /> <br /> <br /> The minimum k for which a graph G has a totally irregular total k-labeling is called the total irregularity strength of G. In this paper, we provide an upper bound and a lower bound of the total irregularity strength of a graf. Besides that, we determine the total irregularity strength of cycles and paths. text |
| institution |
Institut Teknologi Bandung |
| building |
Institut Teknologi Bandung Library |
| continent |
Asia |
| country |
Indonesia Indonesia |
| content_provider |
Institut Teknologi Bandung |
| collection |
Digital ITB |
| language |
Indonesia |
| description |
The vertex irregular total labeling and the edge irregular total labeling were introduced by Baca, Jendrol, Miller, and Ryan in (4). Combining both of these notions, in this paper we introduce a new irregular total labeling, called totally irregular total labeling which is required to be both vertex and edge irregular. <br />
<br />
<br />
<br />
<br />
<br />
<br />
<br />
<br />
<br />
<br />
<br />
<br />
<br />
<br />
The minimum k for which a graph G has a totally irregular total k-labeling is called the total irregularity strength of G. In this paper, we provide an upper bound and a lower bound of the total irregularity strength of a graf. Besides that, we determine the total irregularity strength of cycles and paths. |
| format |
Theses |
| author |
CORAZON MARZUKI (NIM: 20110008), CORRY |
| spellingShingle |
CORAZON MARZUKI (NIM: 20110008), CORRY ON THE TOTAL IRREGULARITY STRENGTH OF CYCLES AND PATHS |
| author_facet |
CORAZON MARZUKI (NIM: 20110008), CORRY |
| author_sort |
CORAZON MARZUKI (NIM: 20110008), CORRY |
| title |
ON THE TOTAL IRREGULARITY STRENGTH OF CYCLES AND PATHS |
| title_short |
ON THE TOTAL IRREGULARITY STRENGTH OF CYCLES AND PATHS |
| title_full |
ON THE TOTAL IRREGULARITY STRENGTH OF CYCLES AND PATHS |
| title_fullStr |
ON THE TOTAL IRREGULARITY STRENGTH OF CYCLES AND PATHS |
| title_full_unstemmed |
ON THE TOTAL IRREGULARITY STRENGTH OF CYCLES AND PATHS |
| title_sort |
on the total irregularity strength of cycles and paths |
| url |
https://digilib.itb.ac.id/gdl/view/15244 |
| _version_ |
1820737426799198208 |