Gordon-Scantlebury and Platt Indices of Random Plane-oriented Recursive Trees

Q: How can I download an article?

To download an article from SID, first log in to the site, search for the article title, and click on the 'Download Article' option.

Q: How can I download an ISI article?

To download an ISI article on SID, enter the keyword or article title in the search bar, view the relevant results, click on the desired article, and select the 'Download Article' option.

Q: How can I access the SID database?

To access the SID database, visit SID.ir, create an account, and log in to access scientific resources.

Q: Is downloading articles from SID free?

Some articles on SID are available for free, while others require payment. Details are specified on the article's page.

Kazemi Ramin

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

Journal Paper

Paper Information

Journal: Mathematics Interdisciplinary Research Year:2021 | Volume:6 | Issue:1 Page(s): 1-10

Download Full-Text

View:

Download:

Cites:

Information Journal Paper

Title

Gordon-Scantlebury and Platt Indices of Random Plane-oriented Recursive Trees

Author(s)

Kazemi Ramin | Issue Writer Certificate

Keywords

Gordon-Scantlebury index‎

‎Platt index‎

‎the first Zagreb index‎

plane-oriented recursive tree‎

‎asymptotic normality

Abstract

‎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‎.

Multimedia

No record.

Cites

No record.

References

No record.

Cite

Related Journal Papers

No record.

Related Seminar Papers

No record.

Related Plans