Gordon-Scantlebury and Platt Indices of Random Plane-oriented Recursive Trees
For a simple graph G, the Gordon-Scantlebury index of G is equal to the number of paths of length two in G, and the Platt index is equal to the total sum of the degrees of all edges in G. In this paper, we study these indices in random plane-oriented recursive trees through a recurrence equ...
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
University of Kashan
2021-03-01
|
| Series: | Mathematics Interdisciplinary Research |
| Subjects: | |
| Online Access: | https://mir.kashanu.ac.ir/article_110787_44ba1fd905ac99274f659196098a164d.pdf |
| _version_ | 1827765037629964288 |
|---|---|
| author | Ramin Kazemi |
| author_facet | Ramin Kazemi |
| author_sort | Ramin Kazemi |
| collection | DOAJ |
| description | For a simple graph G, the Gordon-Scantlebury index of G is equal to the number of paths of length two in G, and the Platt index is equal to the total sum of the degrees of all edges in G. In this paper, we study these indices in random plane-oriented recursive trees through a recurrence equation for the first Zagreb index. As n ∊ ∞, the asymptotic normality of these indices are given. |
| first_indexed | 2024-03-11T11:13:25Z |
| format | Article |
| id | doaj.art-5f5f6a943e7244cd8a8e9d0a2651ac38 |
| institution | Directory Open Access Journal |
| issn | 2476-4965 |
| language | English |
| last_indexed | 2024-03-11T11:13:25Z |
| publishDate | 2021-03-01 |
| publisher | University of Kashan |
| record_format | Article |
| series | Mathematics Interdisciplinary Research |
| spelling | doaj.art-5f5f6a943e7244cd8a8e9d0a2651ac382023-11-11T10:02:49ZengUniversity of KashanMathematics Interdisciplinary Research2476-49652021-03-016111010.22052/mir.2020.231250.1213110787Gordon-Scantlebury and Platt Indices of Random Plane-oriented Recursive TreesRamin Kazemi0Department of Statistics, Imam Khomeini International University, Qazvin, I. R. IranFor a simple graph G, the Gordon-Scantlebury index of G is equal to the number of paths of length two in G, and the Platt index is equal to the total sum of the degrees of all edges in G. In this paper, we study these indices in random plane-oriented recursive trees through a recurrence equation for the first Zagreb index. As n ∊ ∞, the asymptotic normality of these indices are given.https://mir.kashanu.ac.ir/article_110787_44ba1fd905ac99274f659196098a164d.pdfgordon-scantlebury indexplatt indexthe first zagreb indexplane-oriented recursive treeasymptotic normality |
| spellingShingle | Ramin Kazemi Gordon-Scantlebury and Platt Indices of Random Plane-oriented Recursive Trees Mathematics Interdisciplinary Research gordon-scantlebury index platt index the first zagreb index plane-oriented recursive tree asymptotic normality |
| title | Gordon-Scantlebury and Platt Indices of Random Plane-oriented Recursive Trees |
| title_full | Gordon-Scantlebury and Platt Indices of Random Plane-oriented Recursive Trees |
| title_fullStr | Gordon-Scantlebury and Platt Indices of Random Plane-oriented Recursive Trees |
| title_full_unstemmed | Gordon-Scantlebury and Platt Indices of Random Plane-oriented Recursive Trees |
| title_short | Gordon-Scantlebury and Platt Indices of Random Plane-oriented Recursive Trees |
| title_sort | gordon scantlebury and platt indices of random plane oriented recursive trees |
| topic | gordon-scantlebury index platt index the first zagreb index plane-oriented recursive tree asymptotic normality |
| url | https://mir.kashanu.ac.ir/article_110787_44ba1fd905ac99274f659196098a164d.pdf |
| work_keys_str_mv | AT raminkazemi gordonscantleburyandplattindicesofrandomplaneorientedrecursivetrees |