An Inclusive Distance Irregularity Strength of n-ary Tree
An inclusive distance vertex irregular labelling of a simple graph G is a function of the vertex set of to positive integer set such that the sum of its vertex label and the labels of all vertices adjacent to the vertex are distinct. The minimum of maximum label of the vertices is said to be inclus...
Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Universitas Muhammadiyah Mataram
2024-04-01
|
| Series: | JTAM (Jurnal Teori dan Aplikasi Matematika) |
| Subjects: | |
| Online Access: | http://journal.ummat.ac.id/index.php/jtam/article/view/20549 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1846166510302658560 |
|---|---|
| author | Kristiana Wijaya Safira Nur Aulia Ikhsanul Halikin Kusbudiono Kusbudiono |
| author_facet | Kristiana Wijaya Safira Nur Aulia Ikhsanul Halikin Kusbudiono Kusbudiono |
| author_sort | Kristiana Wijaya |
| collection | DOAJ |
| description | An inclusive distance vertex irregular labelling of a simple graph G is a function of the vertex set of to positive integer set such that the sum of its vertex label and the labels of all vertices adjacent to the vertex are distinct. The minimum of maximum label of the vertices is said to be inclusive distance irregularity strength of G, denoted by dis(G). The purpose of this research is showing that dis(T_{n,2})= (n^2+2)/2 where T_{n,2} is a complete n-ary tree to level two. |
| format | Article |
| id | doaj-art-d051fe302cd94a0e82c8857a3dd477c2 |
| institution | Kabale University |
| issn | 2597-7512 2614-1175 |
| language | English |
| publishDate | 2024-04-01 |
| publisher | Universitas Muhammadiyah Mataram |
| record_format | Article |
| series | JTAM (Jurnal Teori dan Aplikasi Matematika) |
| spelling | doaj-art-d051fe302cd94a0e82c8857a3dd477c22024-11-15T16:19:27ZengUniversitas Muhammadiyah MataramJTAM (Jurnal Teori dan Aplikasi Matematika)2597-75122614-11752024-04-018256857710.31764/jtam.v8i2.205498736An Inclusive Distance Irregularity Strength of n-ary TreeKristiana Wijaya0Safira Nur Aulia1Ikhsanul Halikin2Kusbudiono Kusbudiono3Graph and Algebra Research Group Department of Mathematics, Faculty of Mathematics and Natural Sciences, Universitas Jember.Graph and Algebra Research Group Department of Mathematics, Faculty of Mathematics and Natural Sciences, Universitas Jember.Graph and Algebra Research Group Department of Mathematics, Faculty of Mathematics and Natural Sciences, Universitas Jember.Graph and Algebra Research Group Department of Mathematics, Faculty of Mathematics and Natural Sciences, Universitas Jember.An inclusive distance vertex irregular labelling of a simple graph G is a function of the vertex set of to positive integer set such that the sum of its vertex label and the labels of all vertices adjacent to the vertex are distinct. The minimum of maximum label of the vertices is said to be inclusive distance irregularity strength of G, denoted by dis(G). The purpose of this research is showing that dis(T_{n,2})= (n^2+2)/2 where T_{n,2} is a complete n-ary tree to level two.http://journal.ummat.ac.id/index.php/jtam/article/view/20549irregular labellinginclusivevertex weightcomplete n-ary tree |
| spellingShingle | Kristiana Wijaya Safira Nur Aulia Ikhsanul Halikin Kusbudiono Kusbudiono An Inclusive Distance Irregularity Strength of n-ary Tree JTAM (Jurnal Teori dan Aplikasi Matematika) irregular labelling inclusive vertex weight complete n-ary tree |
| title | An Inclusive Distance Irregularity Strength of n-ary Tree |
| title_full | An Inclusive Distance Irregularity Strength of n-ary Tree |
| title_fullStr | An Inclusive Distance Irregularity Strength of n-ary Tree |
| title_full_unstemmed | An Inclusive Distance Irregularity Strength of n-ary Tree |
| title_short | An Inclusive Distance Irregularity Strength of n-ary Tree |
| title_sort | inclusive distance irregularity strength of n ary tree |
| topic | irregular labelling inclusive vertex weight complete n-ary tree |
| url | http://journal.ummat.ac.id/index.php/jtam/article/view/20549 |
| work_keys_str_mv | AT kristianawijaya aninclusivedistanceirregularitystrengthofnarytree AT safiranuraulia aninclusivedistanceirregularitystrengthofnarytree AT ikhsanulhalikin aninclusivedistanceirregularitystrengthofnarytree AT kusbudionokusbudiono aninclusivedistanceirregularitystrengthofnarytree AT kristianawijaya inclusivedistanceirregularitystrengthofnarytree AT safiranuraulia inclusivedistanceirregularitystrengthofnarytree AT ikhsanulhalikin inclusivedistanceirregularitystrengthofnarytree AT kusbudionokusbudiono inclusivedistanceirregularitystrengthofnarytree |