On graphs whose graphoidal domination number is one
Given a graph G=(V,E), a set ψ of non-trivial paths, which are not necessarily open, called ψ-edges, is called a graphoidal cover of G if it satisfies the following conditions: (GC−1) Every vertex of G is an internal vertex of at most one path in ψ, and (GC−2) every edge of G is in exactly one path...
Guardado en:
| Autores principales: | , , |
|---|---|
| Formato: | Artigo |
| Lenguaje: | Inglês |
| Publicado: |
Taylor & Francis Group
2015-11-01
|
| Colección: | AKCE International Journal of Graphs and Combinatorics |
| Materias: | |
| Acceso en línea: | http://www.sciencedirect.com/science/article/pii/S0972860015000341 |
| Etiquetas: |
Sin Etiquetas, Sea el primero en etiquetar este registro!
|