Domination in graphoidally covered graphs: Least-kernel graphoidal graphs-II
Given a graph , not necessarily finite, a graphoidal cover of means a collection of non-trivial paths in called -edges, which are not necessarily open (not necessarily finite), such that every vertex of is an internal vertex of at most one path in and every edge of G is in exactly one path in . The...
Na minha lista:
| Principais autores: | , |
|---|---|
| Format: | Artigo |
| Sprog: | Inglês |
| Udgivet: |
Taylor & Francis Group
2018-04-01
|
| Serier: | AKCE International Journal of Graphs and Combinatorics |
| Fag: | |
| Online adgang: | http://dx.doi.org/10.1016/j.akcej.2018.01.002 |
| Tags: |
Ingen Tags, Vær først til at tagge denne postø!
|