# Total irregular labeling of butterfly network on level two
> Nurdin

URL kanonis: https://discover.unhas.ac.id/publications/total-irregular-labeling-of-butterfly-network-on-level-two
Jurnal / Konferensi: Aip Conference Proceedings
Tahun terbit: 2017
DOI: https://doi.org/10.1063/1.4994470
ISSN: 0094243X
Citations: 4

## Authors
- Nurdin

## Abstract
Previous results related to the concepts of the total irregular labeling of a graph indicate that the butterfly network was one of some graphs which have not been specified in term of the total irregularity strengths. This paper aimed to determine the total vertex irregularity strength, the total edge irregularity strength, and the total irregularity strength of butterfly network on level 2. The assessment of three parameters of butterfly network was conducted by determining the lower bound and the upper bound. The lower bound was analyzed based on the characteristics of the graph and other proponent theorems, while upper bound was analyzed by constructing a function. In this paper we determine that the total vertex irregularity strength, the total edge irregularity strength, and the total irregularity strength of butterfly network are 4, 6, and 6, respectively.

## Keywords
- Butterfly
- Upper and lower bounds
- Vertex (graph theory)
- Enhanced Data Rates for GSM Evolution
- Graph
- Mathematics
- Computer science
- Combinatorics
- Artificial intelligence
- Mathematical analysis
- Biology
- Ecology

---
Sumber: Discover Unhas — RIMS Universitas Hasanuddin.
Saat mengutip, gunakan DOI bila tersedia atau URL kanonis di atas.