TY  - JOUR
ID  - Cichacz2022
LB  - Cichacz2022
AU  - Cichacz, Sylwia
AU  - Görlich, Agnieszka
AU  - Semaničová-Feňovčíková, Andrea
TI  - Upper bounds on distance vertex irregularity strength of some families of graphs
ST  - Upper bounds on distance vertex irregularity strength of some families of graphs
JO  - Opuscula Math.
JA  - Opuscula Math.
JF  - Opuscula Mathematica
PY  - 2022
VL  - 42
IS  - 4
SP  - 561
EP  - 571
DO  - https://doi.org/10.7494/OpMath.2022.42.4.561
UR  - https://doi.org/10.7494/OpMath.2022.42.4.561
AB  - For a graph \(G\) its distance vertex irregularity strength is the smallest integer \(k\) for which one can find a labeling \(f: V(G)\to \{1, 2, \dots, k\}\) such that \[ \sum_{x\in N(v)}f(x)\neq \sum_{x\in N(u)}f(x)\] for all vertices \(u,v\) of \(G\), where \(N(v)\) is the open neighborhood of \(v\). In this paper we present some upper bounds on distance vertex irregularity strength of general graphs. Moreover, we give upper bounds on distance vertex irregularity strength of hypercubes and trees.
KW  - distance vertex irregularity strength of a graph
KW  - hypercube
KW  - tree
SN  - 1232-9274
ER  -