On inclusive 1-Distance Vertex Irregularity Strength of Firecracker, Broom, and Banana Tree

Ikhsanul Halikin, Ade Rizky Savitri, Kristiana Wijaya

2018

Abstract

Let k be a natural number and G be a simple graph. An inclusive d-distance vertex irregular labelling of a graph G is a function so that the weights at each vertex are different. Let v be a vertex of G. The weight of v ∈V(G), denoted by wt(v), is the sum of the label of v and all vertex labels up to distance 1 from v. An inclusive 1-distance vertex irregularity strength of G, denoted by is the minimum k for the existence of an inclusive 1-distance vertex irregular labelling of a G. Here, we find the exact value of an inclusive 1-distance vertex irregularity strength of a firecracker, a broom, anda banana tree.

Paper Citation

in Harvard Style

Halikin I., Savitri A. and Wijaya K. (2018). On inclusive 1-Distance Vertex Irregularity Strength of Firecracker, Broom, and Banana Tree.In Proceedings of the International Conference on Mathematics and Islam - Volume 1: ICMIs, ISBN 978-989-758-407-7, pages 228-232. DOI: 10.5220/0008519802280232

in Bibtex Style

@conference{icmis18,
author={Ikhsanul Halikin and Ade Rizky Savitri and Kristiana Wijaya},
title={On inclusive 1-Distance Vertex Irregularity Strength of Firecracker, Broom, and Banana Tree},
booktitle={Proceedings of the International Conference on Mathematics and Islam - Volume 1: ICMIs,},
year={2018},
pages={228-232},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0008519802280232},
isbn={978-989-758-407-7},
}

in EndNote Style

TY - CONF

JO - Proceedings of the International Conference on Mathematics and Islam - Volume 1: ICMIs,
TI - On inclusive 1-Distance Vertex Irregularity Strength of Firecracker, Broom, and Banana Tree
SN - 978-989-758-407-7
AU - Halikin I.
AU - Savitri A.
AU - Wijaya K.
PY - 2018
SP - 228
EP - 232
DO - 10.5220/0008519802280232