Simon Jäger

collaborators

3 papers

math.CO2017

Equating $k$ Maximum Degrees in Graphs without Short Cycles

M. Fürst, M. Gentner, M. A. Henning +2

For an integer $k$ at least $2$ , and a graph $G$ , let $f_{k} (G)$ be the minimum cardinality of a set $X$ of vertices of $G$ such that $G - X$ has either $k$ vertices of maximum degree…

math.CO2016

Exponential Independence

Simon Jäger, Dieter Rautenbach

For a set $S$ of vertices of a graph $G$ , a vertex $u$ in $V (G) ∖ S$ , and a vertex $v$ in $S$ , let $dist_{(G, S)} (u, v)$ be the distance of $u$ and $v$ in the graph $G-(…

math.CO2016

Relating Domination, Exponential Domination, and Porous Exponential Domination

Michael A. Henning, Simon Jäger, Dieter Rautenbach

The domination number $γ (G)$ of a graph $G$ , its exponential domination number $γ_{e} (G)$ , and its porous exponential domination number $γ_{e}^{*} (G)$ satisfy $γ_e^*(G)\leq γ_e(G)\leq γ(…

Equating k Maximum Degrees in Graphs without Short Cycles

Exponential Independence

Relating Domination, Exponential Domination, and Porous Exponential Domination

Equating $k$ Maximum Degrees in Graphs without Short Cycles