Unicyclic graphs with equal domination and complementary tree domination numbers
Let G = (V, E) be a simple graph. A set <img src="http:/fbpe/img/proy/v35n3/art2_fig1.jpg" width="75" height="18"> is a dominating set if every vertex in V(G) \ D is adjacent to a vertex of D. A dominating set D of a graph G is a complementary tree dominating set...
Enregistré dans:
| Auteurs principaux: | , |
|---|---|
| Langue: | English |
| Publié: |
Universidad Católica del Norte, Departamento de Matemáticas
2016
|
| Sujets: | |
| Accès en ligne: | http://www.scielo.cl/scielo.php?script=sci_arttext&pid=S0716-09172016000300002 |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|