Wird geladen...
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...
Gespeichert in:
| Hauptverfasser: | , , |
|---|---|
| Format: | Artigo |
| Sprache: | Inglês |
| Veröffentlicht: |
Taylor & Francis Group
2015-11-01
|
| Schriftenreihe: | AKCE International Journal of Graphs and Combinatorics |
| Schlagworte: | |
| Online Zugang: | http://www.sciencedirect.com/science/article/pii/S0972860015000341 |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|