A Study on Jaco-Type Graphs
Overview & Synopsis
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.
Indexed from repository: HAL Open Science
(
hal.science)
Keyboard Shortcuts:
← / → for pages • + / - for zoom • 0 to fit width
Powered by Mozilla PDF.js v3.11
Document Information
| Document Title | A Study on Jaco-Type Graphs |
|---|---|
| Author / Organization | Johan Kok, Sudev Naduvath, K P Chithra |
| Subject & Discipline | Multidisciplinary Academic Open Research |
| Categories | Science & Mathematics |
| Publication Year | 2016 |
| License / Rights | Open Access / Creative Commons |
| Resource Verification | Listed PDF (Verification Pending) |
| Original Host Website |
HAL Open Science
(hal.science)
|
| File Format | application/pdf (Portable Document Format) |
| Language | EN |
| Catalog ID | DOC-156638 |
| Original Source Link | Visit Source Page on hal.science » |