Research Article

Level Polynomials of Rooted Trees

Volume: 9 Number: Issue:1 June 6, 2024
EN TR

Level Polynomials of Rooted Trees

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

References

  1. Gini, C. (1912), Veriabilità e Mutabilità. Cuppini, Bologna.
  2. Balaji, H.; Mahmoud, H. (2017) The Gini Index of Random Trees with Applications to Caterpillars, J. Appl. Prob. 54: 701-709.
  3. Domicolo, C.; Mahmoud, H.M. (2019) Degree Based Gini Index for Graphs, Probability in the Engineering and Informational Sciences 34 (2): 1-15.
  4. Wiener, A.H. (1947) Structural determination of paraffin boiling points, J. Am. Chem. Soc. 69: 17-20.
  5. Hosoya, H. (1988) On some counting polynomials in chemistry, Discrete Applied Mathematics 19: 239-257.
  6. Konstantinova, E.V.; Diudea, M.V. (2000) The Wiener Polynomial Derivatives and Other Topological Indices in Chemical Research, Croatica Chemica Acta 73 (2): 383-403.
  7. Estrada, E.; Ovidiu, I.; Gutman, I; Gutierrez, A. (1998) Rodriguez, L.; Extended Wiener indices. A new set of descriptors for quantitative structure-property studies, New J. Chem, 819-822.
  8. Dos ̌lic ́,T. (2008) The vertex-weighted Wiener polynomials for composite graphs, Ars Mathematica Contemporanea 1: 66-80.

Details

Primary Language

English

Subjects

Neural Networks

Journal Section

Research Article

Publication Date

June 6, 2024

Submission Date

April 17, 2024

Acceptance Date

June 5, 2024

Published in Issue

Year 2024 Volume: 9 Number: Issue:1

APA
Şahin, B. (2024). Level Polynomials of Rooted Trees. Computer Science, 9(Issue:1), 72-83. https://doi.org/10.53070/bbd.1469625
AMA
1.Şahin B. Level Polynomials of Rooted Trees. JCS. 2024;9(Issue:1):72-83. doi:10.53070/bbd.1469625
Chicago
Şahin, Bünyamin. 2024. “Level Polynomials of Rooted Trees”. Computer Science 9 (Issue:1): 72-83. https://doi.org/10.53070/bbd.1469625.
EndNote
Şahin B (June 1, 2024) Level Polynomials of Rooted Trees. Computer Science 9 Issue:1 72–83.
IEEE
[1]B. Şahin, “Level Polynomials of Rooted Trees”, JCS, vol. 9, no. Issue:1, pp. 72–83, June 2024, doi: 10.53070/bbd.1469625.
ISNAD
Şahin, Bünyamin. “Level Polynomials of Rooted Trees”. Computer Science 9/Issue:1 (June 1, 2024): 72-83. https://doi.org/10.53070/bbd.1469625.
JAMA
1.Şahin B. Level Polynomials of Rooted Trees. JCS. 2024;9:72–83.
MLA
Şahin, Bünyamin. “Level Polynomials of Rooted Trees”. Computer Science, vol. 9, no. Issue:1, June 2024, pp. 72-83, doi:10.53070/bbd.1469625.
Vancouver
1.Bünyamin Şahin. Level Polynomials of Rooted Trees. JCS. 2024 Jun. 1;9(Issue:1):72-83. doi:10.53070/bbd.1469625

The Creative Commons Attribution 4.0 International License 88x31.png is applied to all research papers published by JCS and

A Digital Object Identifier (DOI) Logo_TM.png is assigned for each published paper