Enter your keyword

2-s2.0-84984577760

[vc_empty_space][vc_empty_space]

Total vertex irregularity strength of trees with maximum degree four

Susilawatia, Baskoro E.T.b, Simanjuntak R.c

a Combinatorial Mathematics Research Group, Faculty of Mathematics and Natural Sciences, Insitut Teknologi Bandung, Bandung, 40132, Indonesia
b
c

[vc_row][vc_column][vc_row_inner][vc_column_inner][vc_separator css=”.vc_custom_1624529070653{padding-top: 30px !important;padding-bottom: 30px !important;}”][/vc_column_inner][/vc_row_inner][vc_row_inner layout=”boxed”][vc_column_inner width=”3/4″ css=”.vc_custom_1624695412187{border-right-width: 1px !important;border-right-color: #dddddd !important;border-right-style: solid !important;border-radius: 1px !important;}”][vc_empty_space][megatron_heading title=”Abstract” size=”size-sm” text_align=”text-left”][vc_column_text]© 2016 AIP Publishing LLC.Let G(V, E) be a simple graph. For a labeling φ : V (G) ∪ E(G) → {1, 2, …, k} the weight of a vertex x is defined as wt(x) = φ (x) + Σy ∈ N(x) φ (xy), where N(x) is the set of neighbors of x and y. The labeling φ is called a vertex irregular total k-labeling if for every pair of distinct vertices x and y we have wt(x) ≠ wt(y). The minimum k for which the graph G has a vertex irregular total k-labeling is called the total vertex irregularity strength of G and is denoted by tvs(G). In this paper, we determine total vertex irregularity strengths of trees with maximum degree four and a subdivision of a double-star.[/vc_column_text][vc_empty_space][vc_separator css=”.vc_custom_1624528584150{padding-top: 25px !important;padding-bottom: 25px !important;}”][vc_empty_space][megatron_heading title=”Author keywords” size=”size-sm” text_align=”text-left”][vc_column_text][/vc_column_text][vc_empty_space][vc_separator css=”.vc_custom_1624528584150{padding-top: 25px !important;padding-bottom: 25px !important;}”][vc_empty_space][megatron_heading title=”Indexed keywords” size=”size-sm” text_align=”text-left”][vc_column_text]irregularity strength,subdivision,tree[/vc_column_text][vc_empty_space][vc_separator css=”.vc_custom_1624528584150{padding-top: 25px !important;padding-bottom: 25px !important;}”][vc_empty_space][megatron_heading title=”Funding details” size=”size-sm” text_align=”text-left”][vc_column_text][/vc_column_text][vc_empty_space][vc_separator css=”.vc_custom_1624528584150{padding-top: 25px !important;padding-bottom: 25px !important;}”][vc_empty_space][megatron_heading title=”DOI” size=”size-sm” text_align=”text-left”][vc_column_text]https://doi.org/10.1063/1.4940823[/vc_column_text][/vc_column_inner][vc_column_inner width=”1/4″][vc_column_text]Widget Plumx[/vc_column_text][/vc_column_inner][/vc_row_inner][/vc_column][/vc_row][vc_row][vc_column][vc_separator css=”.vc_custom_1624528584150{padding-top: 25px !important;padding-bottom: 25px !important;}”][/vc_column][/vc_row]