Dergiler / Communications in Advanced Mathematical Sciences / 2021 / Cilt: 4 - Sayı: 2

Reachability Results in Plane Trees

Sayfa
75–88
Yayın Tarihi
2021-06-30
DOI
—
🏛️Bu makalenin bibliyografik verileri ve tam metin bağlantısı DergiPark üzerinden sağlanmıştır.
DergiPark Kaydı ↗
✨

Yapay Zeka Hızlı Bakış & Çıkarımlar

AI Insight
⚡ TL;DR(1 Cümlede Hızlı Çıkarım)

Moreover, we obtain a counting formula for the number of plane trees on $n$ vertices such that exactly $k\leq n$ are reachable from the root.

📌 3 Maddede Bu Makale

🎯
Amaç & Hipotez:In this paper, we obtain closed formulas for the number of reachable vertices in labelled plane trees by paths lengths, sinks, leaf sinks, first children, left most path, non-first children, and non-leaves.
📊
Temel Bulgular & Veri:Our counting objects are plane trees having their edges oriented from a vertex of lower label towards a vertex of higher label.
💡
Sonuç & Katkı:Moreover, we obtain a counting formula for the number of plane trees on $n$ vertices such that exactly $k\leq n$ are reachable from the root.
🔬Tür:Araştırma Makalesi
📍Kapsam:Genişletilmiş Akademik Örneklem
⚙️Değişkenler:Plane tree · Leaf · Sink

Abstract

In this paper, we obtain closed formulas for the number of reachable vertices in labelled plane trees by paths lengths, sinks, leaf sinks, first children, left most path, non-first children, and non-leaves. Our counting objects are plane trees having their edges oriented from a vertex of lower label towards a vertex of higher label. For each statistic, we obtain the average number of reachable vertices. Moreover, we obtain a counting formula for the number of plane trees on $n$ vertices such that exactly $k\leq n$ are reachable from the root.

Anahtar kelimeler
🔖

Bu Makaleye Atıf Yap

NYARİARO, A., OKOTH, I. O. (2021). Reachability Results in Plane Trees. Communications in Advanced Mathematical Sciences, Cilt: 4 - Sayı: 2, 75–88. https://ajindex.com/articles/748239

📄 Tam Metin PDF Okuyucu

📄

PDF görüntüleyici hazırlanıyor...

Kaynakça (5)

  1. R. R. X. Du, J.Yin. Countinglabelledtreeswithagivenindegreesequence. J.Combin.Theory,Ser.A,117(3)(2010),345– 353
  2. I. O. Okoth. Combinatorics of oriented trees and tree-like structures. PhD Thesis, Stellenbosch University, (2015)
  3. I. O. Okoth, A. O. Nyariaro. Reachability results in labelled t-ary trees. Preprint, (2021)
  4. S. Seo, H. Shin. On the enumeration of rooted trees with fixed size of maximal decreasing trees. Discrete Math.,312(2) (2012), 419–426
  5. H. S. Wilf. Generatingfunctionology. A. K. Peters, Ltd., Natick, MA, USA, (2006).