Daniel Weißauer

collaborators

2 papers

math.CO2017

Steiner trees and higher geodecity

Daniel Weißauer

Let $G$ be a connected graph and $ℓ : E (G) \to R^{+}$ a length-function on the edges of $G$ . The Steiner distance $sd_{G} (A)$ of $A \subseteq V (G)$ within $G$ is t…

math.CO2017

On the block number of graphs

Daniel Weißauer

A $k$ -block in a graph $G$ is a maximal set of at least $k$ vertices no two of which can be separated in $G$ by deleting fewer than $k$ vertices. The block number $β (G)$ of $G$ is…