Repository logo

Browsing by Subject "distance vertex irregularity strength of a graph"

Filter results by typing the first few letters
Now showing 1 - 1 of 1
  • thumbnail.journal.alt
    Item type:Article, Access status: Open Access ,
    Upper bounds on distance vertex irregularity strength of some families of graphs
    (Wydawnictwa AGH, 2022) Cichacz-Przeniosło, Sylwia; Görlich, Agnieszka; Semaničová-Feňovčíková, Andrea
    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.