RADIO LABELING OF BANANA GRAPHS
Let G=(V, E) be a graph. An L(3,2,1) labeling of G is a function such that for every , , and if . Let , a labeling is a labeling where all labels are not greater than . An ) number of , denoted by , is the smallest non-negative integer such that has a labeling. In this paper, w...
Saved in:
| Main Authors: | , , , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Universitas Pattimura
2023-04-01
|
| Series: | Barekeng |
| Subjects: | |
| Online Access: | https://ojs3.unpatti.ac.id/index.php/barekeng/article/view/6794 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1849407867129430016 |
|---|---|
| author | Sarbaini Sarbaini Nazaruddin Nazaruddin Muhammad Rizki Muhammad Isnaini Hadiyul Umam Muhammad Luthfi Hamzah Tegar Arifin Prasetyo |
| author_facet | Sarbaini Sarbaini Nazaruddin Nazaruddin Muhammad Rizki Muhammad Isnaini Hadiyul Umam Muhammad Luthfi Hamzah Tegar Arifin Prasetyo |
| author_sort | Sarbaini Sarbaini |
| collection | DOAJ |
| description | Let G=(V, E) be a graph. An L(3,2,1) labeling of G is a function such that for every , , and if . Let , a labeling is a labeling where all labels are not greater than . An ) number of , denoted by , is the smallest non-negative integer such that has a labeling. In this paper, we determine of banana graphs. |
| format | Article |
| id | doaj-art-edf31e5279ea4c54bcb5b8f6e94ec32c |
| institution | Kabale University |
| issn | 1978-7227 2615-3017 |
| language | English |
| publishDate | 2023-04-01 |
| publisher | Universitas Pattimura |
| record_format | Article |
| series | Barekeng |
| spelling | doaj-art-edf31e5279ea4c54bcb5b8f6e94ec32c2025-08-20T03:35:55ZengUniversitas PattimuraBarekeng1978-72272615-30172023-04-011710165017010.30598/barekengvol17iss1pp0165-01706794RADIO LABELING OF BANANA GRAPHSSarbaini Sarbaini0Nazaruddin Nazaruddin1Muhammad Rizki2Muhammad Isnaini Hadiyul Umam3Muhammad Luthfi Hamzah4Tegar Arifin Prasetyo5Department of Mathematics, Faculty of Sciences Technology, Universitas Islam Negeri Sultan Syarif Kasim, IndonesiaDepartment of Industrial Engineering, Faculty of Sciences Technology, Universitas Islam Negeri Sultan Syarif Kasim, IndonesiaDepartment of Industrial Engineering, Faculty of Sciences Technology, Universitas Islam Negeri Sultan Syarif Kasim, IndonesiaDepartment of Industrial Engineering, Faculty of Sciences Technology, Universitas Islam Negeri Sultan Syarif Kasim, IndonesiaDepartment of Information System, Faculty of Sciences Technology, Universitas Islam Negeri Sultan Syarif Kasim, IndonesiaInstitut Teknologi Del, IndonesiaLet G=(V, E) be a graph. An L(3,2,1) labeling of G is a function such that for every , , and if . Let , a labeling is a labeling where all labels are not greater than . An ) number of , denoted by , is the smallest non-negative integer such that has a labeling. In this paper, we determine of banana graphs.https://ojs3.unpatti.ac.id/index.php/barekeng/article/view/6794banana graphsgraph theorylabeling |
| spellingShingle | Sarbaini Sarbaini Nazaruddin Nazaruddin Muhammad Rizki Muhammad Isnaini Hadiyul Umam Muhammad Luthfi Hamzah Tegar Arifin Prasetyo RADIO LABELING OF BANANA GRAPHS Barekeng banana graphs graph theory labeling |
| title | RADIO LABELING OF BANANA GRAPHS |
| title_full | RADIO LABELING OF BANANA GRAPHS |
| title_fullStr | RADIO LABELING OF BANANA GRAPHS |
| title_full_unstemmed | RADIO LABELING OF BANANA GRAPHS |
| title_short | RADIO LABELING OF BANANA GRAPHS |
| title_sort | radio labeling of banana graphs |
| topic | banana graphs graph theory labeling |
| url | https://ojs3.unpatti.ac.id/index.php/barekeng/article/view/6794 |
| work_keys_str_mv | AT sarbainisarbaini radiolabelingofbananagraphs AT nazaruddinnazaruddin radiolabelingofbananagraphs AT muhammadrizki radiolabelingofbananagraphs AT muhammadisnainihadiyulumam radiolabelingofbananagraphs AT muhammadluthfihamzah radiolabelingofbananagraphs AT tegararifinprasetyo radiolabelingofbananagraphs |