L. Volkmann

activity

20172020

most citedSufficient conditions for graphs to be

k

-connected, maximally connected and super-connected

2 citations · 2 across the 1 of their papers we have counts for

collaborators

3 papers

math.CO2020

The Roman (k,k)-domatic number of a graph

A. P. Kazemi, S. M. Sheikholeslami, L. Volkmann

Let $k$ be a positive integer. A {\em Roman $k$ -dominating function} on a graph $G$ is a labeling $f : V (G) ⟶ {0, 1, 2}$ such that every vertex with label 0 has at le…

math.CO2018

Bounds on the nonnegative signed domination number of graphs

Doost Ali Mojdeh, Babak Samadi, Lutz Volkmann

The aim of this work is to investigate the nonnegative signed domination number $γ_{s}^{N N}$ with emphasis on regular, ( $r + 1$ )-clique-free graphs and trees. We give lower and upper b…

math.CO2017★ 2 cited

Sufficient conditions for graphs to be $k$ -connected, maximally connected and super-connected

Zhen-Mu Hong, Zheng-Jiang Xia, Fuyuan Chen +1

Let $G$ be a connected graph with minimum degree $δ (G)$ and vertex-connectivity $κ (G)$ . The graph $G$ is $k$ -connected if $κ (G) \geq k$ , maximally connected if $κ (G) = δ (G)$ , and su…

The Roman (k,k)-domatic number of a graph

Bounds on the nonnegative signed domination number of graphs

Sufficient conditions for graphs to be k-connected, maximally connected and super-connected

Sufficient conditions for graphs to be $k$ -connected, maximally connected and super-connected