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:
| Published in: | JTAM (Jurnal Teori dan Aplikasi Matematika) (Online) Vol. 8; no. 2; p. 568 |
|---|---|
| Main Authors: | , , , |
| Format: | Journal Article |
| Language: | English |
| Published: |
02-04-2024
|
| Online Access: | Get full text |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | 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. |
|---|---|
| ISSN: | 2597-7512 2614-1175 |
| DOI: | 10.31764/jtam.v8i2.20549 |