Upper bounds on inclusive distance vertex irregularity strength
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.
- On inclusive distance vertex irregular labelings
- Non-inclusive and inclusive distance irregularity strength for the join product of graphs
- Further results on local inclusive distance vertex irregularity strength of graphs
- On inclusive and non-inclusive vertex irregular d-distance vertex labelings
- Upper bounds on distance vertex irregularity strength of some families of graphs
- A new upper bound for the irregularity strength of graphs
- A Tight Bound on the Irregularity Strength of Graphs
- Additive coloring of planar graphs
- scientific article; zbMATH DE number 4097437 (Why is no real title available?)
- scientific article; zbMATH DE number 47933 (Why is no real title available?)
- scientific article; zbMATH DE number 1998306 (Why is no real title available?)
- Irregular Assignments of Trees and Forests
- Lucky labelings of graphs
- On distance irregular labelings of cycles and wheels
- On distance irregular labelling of graphs
- On inclusive and non-inclusive vertex irregular d-distance vertex labelings
- On inclusive distance vertex irregular labelings
- On inclusive \(d\)-distance irregularity strength on triangular ladder graph and path
- On inclusive distance vertex irregular labelings
- Non-inclusive and inclusive distance irregularity strength for the join product of graphs
- Upper bounds on distance vertex irregularity strength of some families of graphs
- On inclusive and non-inclusive vertex irregular d-distance vertex labelings
- Irregular Domination Trees and Forests
- Further results on local inclusive distance vertex irregularity strength of graphs
This page was built for publication: Upper bounds on inclusive distance vertex irregularity strength
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2053732)
