204 citations
- Trier University of Applied SciencesDE9 papers
- German Research Centre for Artificial IntelligenceDE6 papers
- University of KaiserslauternDE6 papers
- Fraunhofer Institute for Industrial MathematicsDE5 papers
- KU LeuvenBE5 papers
- University of WürzburgDE5 papers
- Laboratoire de Probabilités et Modèles AléatoiresFR4 papers
- Universidad Carlos III de MadridES4 papers
- Carl von Ossietzky Universität OldenburgDE3 papers
- Institute of Mathematical SciencesIN3 papers
- Sapienza University of RomeIT3 papers
- Universidad Autónoma de MadridES3 papers
4 papers · 1 filter
On the (adjacency) metric dimension of corona and strong product graphs and their local variants: combinatorial and computational results
Juan A. Rodríguez-Velázquez, Henning Fernau
The metric dimension is quite a well-studied graph parameter. Recently, the adjacency metric dimension and the local metric dimension have been introduced. We combine these variant…
On a conjecture on sparse binomial-type polynomials by Brown, Dilcher and Manna
Wolfgang Gawronski, Thorsten Neuschel
We prove a conjecture by Brown, Dilcher and Manna on the asymptotic behavior of sparse binomial-type polynomials arising naturally in a graph theoretical context in connection with…
Strongly continuous semigroups on some Fréchet spaces
Leonhrd Frerick, Enrique Jordá, Thomas Kalmes +1
We prove that for a strongly continuous semigroup on the Fréchet space of all scalar sequences, its generator is a continuous linear operator and that the semigroup can be represen…
A copositive formulation for the stability number of infinite graphs
Cristian Dobre, Mirjam Dür, Leonhard Frerick +1
In the last decade, copositive formulations have been proposed for a variety of combinatorial optimization problems, for example the stability number (independence number). In this…