11,165 research outputs found
A Greedy Partition Lemma for Directed Domination
A directed dominating set in a directed graph is a set of vertices of
such that every vertex has an adjacent vertex
in with directed to . The directed domination number of , denoted
by , is the minimum cardinality of a directed dominating set in .
The directed domination number of a graph , denoted , which is
the maximum directed domination number over all orientations of
. The directed domination number of a complete graph was first studied by
Erd\"{o}s [Math. Gaz. 47 (1963), 220--222], albeit in disguised form. In this
paper we prove a Greedy Partition Lemma for directed domination in oriented
graphs. Applying this lemma, we obtain bounds on the directed domination
number. In particular, if denotes the independence number of a graph
, we show that .Comment: 12 page
Thermal behavior of radiation damage cascades via the binary collision approximation: Comparison with molecular dynamics results
Based on the profile of the energy deposition obtained using the binary collision model, we follow the diffusion of energy by solving a simplified version of the heat equation. An estimation of the molten zone compares very well with the molecular dynamics prediction for the same event. We discuss the reasons for this agreement and the relevance of such simplified procedure in terms of present-day computer limitations to simulate high energy cascades using molecular dynamic
- …