Upper bounds on inclusive distance vertex irregularity strength
type: Item
instance of: scholarly article
title: Upper bounds on inclusive distance vertex irregularity strength
zbMATH Open document ID: 1479.05079
author: Sylwia Cichacz
author: Andrea Semaničová-Feňovčíková
author: Agnieszka Görlich
published in: Graphs and Combinatorics
publication date: 2021-11-30T00:00:00Z
review text: An inclusive distance vertex irregular labeling of a graph $G$ is an assignment of positive integers \(\{1,2,3,\dots,k\}\) to the vertices of $G$ such that for every vertex the sum of numbers assigned to its closed neighborhood is different. The minimum number $k$ for which an inclusive distance vertex irregular labeling of $G$ exists is denoted by $(\text{dis})(G)$. In this paper, the authors find some upper bounds of $(\text{dis})(G)$ for any distinct vertices of a graph $G$ and also for the forest and spider graph and finish the paper with a conjecture on trees for further research.
reviewed by: P. Jeyanthi
Mathematics Subject Classification ID: 05C12
Mathematics Subject Classification ID: 05C78
zbMATH DE Number: 7435751
zbMATH Keywords: inclusive distance vertex irregularity
zbMATH Keywords: irregular labeling
MaRDI profile type: Publication
full work available at URL: s00373-021-02385-8
OpenAlex ID: W3185653960
cites work: Irregular Assignments of Trees and Forests
cites work: On inclusive distance vertex irregular labelings
cites work: Additive coloring of planar graphs
cites work: Q4595661
cites work: Q5858882
cites work: Q3824455
cites work: Lucky labelings of graphs
cites work: A New Upper Bound for the Irregularity Strength of Graphs
cites work: Q4432951
cites work: A Tight Bound on the Irregularity Strength of Graphs
cites work: Q3999001
cites work: ON DISTANCE IRREGULAR LABELLING OF GRAPHS
DOI: 10.1007/S00373-021-02385-8
description: scientific article; zbMATH DE number 7435751