All Outputs (5)

Braess’ paradox in generalised traffic networks (2013)
Presentation / Conference Contribution

The bondage number of graphs on topological surfaces and Teschner's conjecture (2013)
Presentation / Conference Contribution

Randomized algorithms and upper bounds for multiple domination in graphs and networks (2013)
Presentation / Conference Contribution

We consider four different types of multiple domination and provide new improved upper bounds for the k- and k-tuple domination numbers. They generalize two classical bounds for the domination number and are better than a number of known upper bounds... Read More about Randomized algorithms and upper bounds for multiple domination in graphs and networks.

The bondage number of graphs on topological surfaces and Teschner's conjecture (2013)
Journal Article

The bondage number of a graph is the smallest number of its edges whose removal results in a graph having a larger domination number. We provide constant upper bounds for the bondage number of graphs on topological surfaces, and improve upper bounds... Read More about The bondage number of graphs on topological surfaces and Teschner's conjecture.

Upper bounds for the bondage number of graphs on topological surfaces (2013)
Journal Article

The bondage number b(G) of a graph G is the smallest number of edges of G whose removal results in a graph having the domination number larger than that of G. We show that, for a graph G having the maximum vertex degree Δ(G) and embeddable on an orie... Read More about Upper bounds for the bondage number of graphs on topological surfaces.