Article
Version 1
Preserved in Portico This version is not peer-reviewed
Level Polynomials of Rooted Trees
Version 1
: Received: 12 December 2023 / Approved: 12 December 2023 / Online: 12 December 2023 (16:11:44 CET)
A peer-reviewed article of this Preprint also exists.
Şahin, B. (2024). Level Polynomials of Rooted Trees. Computer Science, 9(Issue:1), 72-83. https://doi.org/10.53070/bbd.1469625 Şahin, B. (2024). Level Polynomials of Rooted Trees. Computer Science, 9(Issue:1), 72-83. https://doi.org/10.53070/bbd.1469625
Abstract
Level index was introduced in 2017 for rooted trees which is a component of Gini index. In the origin, Gini index is a tool for economical investigations but Balaji and Mahmoud defined the graph theoretical applications of this index for statistical analysis of graphs. Level index is an important component of Gini index. In this paper we define a new graph polynomial which is called level polynomial and calculate the level polynomial of some classes of trees. We obtain some interesting relations between the level polynomials and some integer sequences.
Keywords
Level index; Level polynomial; Triangular Numbers; Subdivision of Stars; Dendrimers
Subject
Computer Science and Mathematics, Computer Networks and Communications
Copyright: This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
Comments (0)
We encourage comments and feedback from a broad range of readers. See criteria for comments and our Diversity statement.
Leave a public commentSend a private comment to the author(s)
* All users must log in before leaving a comment
