Article Dans Une Revue Journal of Informatics and Mathematical Sciences Année : 2016

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.

Fichier principal
Vignette du fichier
4. A Study on Jaco-Type Graphs (2016) [J. Inform. Math Sci.].pdf (357.43 Ko) Télécharger le fichier
Origine Publication financée par une institution
Licence
Loading...

Dates et versions

hal-02099249 , version 1 (07-05-2019)

Licence

Identifiants

  • HAL Id : hal-02099249 , version 1

Citer

Johan Kok, Sudev Naduvath, K P Chithra. A Study on Jaco-Type Graphs. Journal of Informatics and Mathematical Sciences, 2016, 8, pp.105 - 112. ⟨hal-02099249⟩
68 Consultations
166 Téléchargements

Partager

  • More