Evènement pour le groupe GT Graphes et Applications
|Date|| 2012-09-14 14:00-15:00|
|Titre||Domination de puissance dans les graphes réguliers |
|Résumé||Power domination in graphs was birthed from the problem of monitoring an electric power system by placing as few measurement devices in the system as possible. A set of vertices is defined to be a power dominating set of a graph if every vertex and every edge in the system is monitored by the set following a set of rules (according to Kirschoff laws) for power system monitoring. Last year, we proposed some common generalization to domination and power domination. Whereas the definition of a power dominating set implies some propagating behavior of the set of monitored vertices, a phenomenon very different from the standard domination parameter, this generalization revealed some common properties of the two problems.
After a rather general introduction on power domination and its generalization, we will show some recent bounds on the generalized power domination number of regular graphs. |
|Lieu||Salle ALP, batiment A9 |
|Orateur||Paul Dorbec |
Aucun document lié à cet événement.RetourRetour à l'index