A Study on Jaco-Type Graphs
Résumé
For a sequence {a n } in general where a n ∈ N and a n+1 ≥ a n , n = 1, 2, 3,. . ., a new population of directed graphs is defined such that for a given sequence {a n } the infinite directed root-graph has d + (v n) = a n. The infinite directed root-graph is denoted J ∞ ({a n }). The family of finite Jaco-type graphs is the set of directed graphs J n ({a n }), n ∈ N by lobbing off all vertices and arcs in J ∞ ({a n }) for vertices v i , i > n. We present introductory results for two families of these new directed graphs.
| Origine | Publication financée par une institution |
|---|---|
| Licence |