# Search results for: Simon Jäger

Discussiones Mathematicae Graph Theory > 2017 > 38 > 1 > 275-285

Discrete Mathematics > 2018 > 341 > 1 > 119-125

Discrete Mathematics > 2017 > 340 > 11 > 2650-2658

Discussiones Mathematicae Graph Theory > 2017 > 38 > 1 > 275-285

We characterize a large subclass of the class of those graphs G for which the exponential domination number of H equals the domination number of H for every induced subgraph H of G.

Discrete Mathematics > 2018 > 341 > 1 > 119-125

A prominent parameter in the context of network analysis, originally proposed by Watts and Strogatz (1998), is the clustering coefficient of a graph G . It is defined as the arithmetic mean of the clustering coefficients of its vertices, where the clustering coefficient of a vertex u of G is the relative density m ( G [ N G ( u ) ] ) ∕ d G ( u ) 2 of its neighborhood...

Discrete Mathematics > 2017 > 340 > 11 > 2650-2658

For a set S of vertices of a graph G , a vertex u in V ( G ) ∖ S , and a vertex v in S , let dist ( G , S ) ( u , v ) be the distance of u and v in the graph G − ( S ∖ { v } ) . Dankelmann et al. (2009) define S to be an exponential dominating set of G if w ( G , S ) ( u ) ≥ 1 for every vertex u in V ( G ) ∖ S , where w ( G , S ) ( u...