Efficient and Perfect domination on circular-arc graphs
Given a graph G=(V, E), a perfect dominating set is a subset of vertices V ' ⊆V(G) such that each vertex v∈V(G)\\V' is dominated by exactly one vertex v'∈V'. An efficient dominating set is a perfect dominating set V ' where V ' is also an independent set. These problems...
Guardado en:
| Autores principales: | Lin, M.C., Mizrahi, M.J., Szwarcfiter, J.L. |
|---|---|
| Formato: | JOUR |
| Materias: | |
| Acceso en línea: | http://hdl.handle.net/20.500.12110/paper_15710653_v50_n_p307_Lin |
| Aporte de: |
Ejemplares similares
-
Efficient and Perfect domination on circular-arc graphs
Publicado: (2015) -
Characterization and recognition of Helly circular-arc clique-perfect graphs
por: Bonomo, Flavia, et al.
Publicado: (2005) -
Characterization and recognition of Helly circular-arc clique-perfect graphs
por: Bonomo, F., et al. -
Balancedness of subclasses of circular-arc graphs
por: Bonomo, F., et al. -
Balancedness of subclasses of circular-arc graphs
por: Bonomo, Flavia, et al.
Publicado: (2014)