A linear time algorithm for minimum equitable dominating set in trees
Abstract Let G = (V, E) be a graph. A subset D e of V is said to be an equitable dominating set if for every v ∈ V \ D e there exists u ∈ D e such that uv ∈ E and |deg(u) − deg(v)| ≤ 1, where, deg(u) and deg(v) denote the degree of the vertices u...
Saved in:
| Main Authors: | , |
|---|---|
| Language: | English |
| Published: |
Universidad Católica del Norte, Departamento de Matemáticas
2021
|
| Subjects: | |
| Online Access: | http://www.scielo.cl/scielo.php?script=sci_arttext&pid=S0716-09172021000400805 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|