Universität Ulm

output

20022024

most citedTwo-dimensional transition metal dichalcogenides under electron irradiation: defect production and doping

1.2k citations

Showing 2015Show all

22 papers · 1 filter

math.CO2015

Strong Equality of Roman and Weak Roman Domination in Trees

Jose D. Alvarado, Simone Dantas, Dieter Rautenbach

We provide a constructive characterization of the trees for which the Roman domination number strongly equals the weak Roman domination number, that is, for which every weak Roman…

math.CO2015★ 1 cited

Averaging $2$ -Rainbow Domination and Roman Domination

Jose D. Alvarado, Simone Dantas, Dieter Rautenbach

For a graph $G$ , let $γ_{r 2} (G)$ and $γ_{R} (G)$ denote the $2$ -rainbow domination number and the Roman domination number, respectively. Fujita and Furuya (Difference between 2-rainbo…

math.CO2015

Largest Domination Number and Smallest Independence Number of Forests with given Degree Sequence

Michael Gentner, Michael A. Henning, Dieter Rautenbach

For a sequence $d$ of non-negative integers, let $F (d)$ be the set of all forests whose degree sequence is $d$ . We present closed formulas for $γ_{\max}^{\cal F}(d)=\max\{ γ…

math.CO2015

Independence in Uniform Linear Triangle-free Hypergraphs

Piotr Borowiecki, Michael Gentner, Christian Löwenstein +1

The independence number $α (H)$ of a hypergraph $H$ is the maximum cardinality of a set of vertices of $H$ that does not contain an edge of $H$ . Generalizing Shearer's classical low…

math.CO2015

Forbidden Induced Subgraphs for Bounded $p$ -Intersection Number

Claudson F. Bornstein, Jose W. C. Pinto, Dieter Rautenbach +1

A graph $G$ has $p$ -intersection number at most $d$ if it is possible to assign to every vertex $u$ of $G$ , a subset $S (u)$ of some ground set $U$ with $∣ U ∣ = d$ in such a way that d…

math.CO2015

Two Greedy Consequences for Maximum Induced Matchings

Dieter Rautenbach

We prove that, for every integer $d$ with $d \geq 3$ , there is an approximation algorithm for the maximum induced matching problem restricted to ${C_{3}, C_{5}}$ -free $d$ -regular grap…

Strong Equality of Roman and Weak Roman Domination in Trees

Averaging 2-Rainbow Domination and Roman Domination

Largest Domination Number and Smallest Independence Number of Forests with given Degree Sequence

Independence in Uniform Linear Triangle-free Hypergraphs

Forbidden Induced Subgraphs for Bounded p-Intersection Number

Two Greedy Consequences for Maximum Induced Matchings

Averaging $2$ -Rainbow Domination and Roman Domination

Forbidden Induced Subgraphs for Bounded $p$ -Intersection Number