5 papers
Equating Maximum Degrees in Graphs without Short Cycles
M. Fürst, M. Gentner, M. A. Henning +2
For an integer at least , and a graph , let be the minimum cardinality of a set of vertices of such that has either vertices of maximum degree…
Dynamic Monopolies for Degree Proportional Thresholds in Connected Graphs of Girth at least Five and Trees
Michael Gentner, Dieter Rautenbach
Let be a graph, and let . For a set of vertices of , let the set arise by starting with the set , and iteratively adding further vertices to…
Largest Domination Number and Smallest Independence Number of Forests with given Degree Sequence
Michael Gentner, Michael A. Henning, Dieter Rautenbach
For a sequence of non-negative integers, let be the set of all forests whose degree sequence is . We present closed formulas for $γ_{\max}^{\cal F}(d)=\max\{ γ…
Smallest Domination Number and Largest Independence Number of Graphs and Forests with given Degree Sequence
Michael Gentner, Michael A. Henning, Dieter Rautenbach
For a sequence of non-negative integers, let and be the sets of all graphs and forests with degree sequence , respectively. Let $γ_{\min}(d)=\min…
Independence in Uniform Linear Triangle-free Hypergraphs
Piotr Borowiecki, Michael Gentner, Christian Löwenstein +1
The independence number of a hypergraph is the maximum cardinality of a set of vertices of that does not contain an edge of . Generalizing Shearer's classical low…