Spanning trees for many different numbers of leaves

Autor: Noguchi, Kenta, Zamfirescu, Carol T.

Publikováno v: Discrete Mathematics & Theoretical Computer Science, vol. 26:3, Graph Theory (November 18, 2024) dmtcs:13116

Let $G$ be a connected graph and $L(G)$ the set of all integers $k$ such that $G$ contains a spanning tree with exactly $k$ leaves. We show that for a connected graph $G$, the set $L(G)$ is contiguous. It follows from work of Chen, Ren, and Shan that

Externí odkaz: http://arxiv.org/abs/2312.13674

Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.

Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.

Moments of level numbers of leaves in binary trees

Autor: Alois Panholzer, Helmut Prodinger

Publikováno v: Journal of Statistical Planning and Inference. 101:267-279

For the random variable “height of leaf j in a binary tree of size n ” we derive closed formulae for all moments. The more general case of t -ary trees is also considered.

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::cbed54491cd741460aaa643d093ddb62
https://doi.org/10.1016/s0378-3758(01)00187-2

A high‐resolution model of the grapevine leaf morphospace predicts synthetic leaves.

Autor: Chitwood, Daniel H.^1,2 (AUTHOR) dhchitwood@gmail.com, Torres‐Lomas, Efrain³ (AUTHOR), Hadi, Ebi S.³ (AUTHOR), Peterson, Wolfgang L. G.³ (AUTHOR), Fischer, Mirjam F.³ (AUTHOR), Rogers, Sydney E.³ (AUTHOR), He, Chuan³ (AUTHOR), Acierno, Michael G. F.³ (AUTHOR), Azumaya, Shintaro³ (AUTHOR), Benjamin, Seth Wayne¹ (AUTHOR), Chalise, Devendra Prasad⁴ (AUTHOR), Chess, Ellice E.⁵ (AUTHOR), Engelsma, Alex J.¹ (AUTHOR), Fu, Qiuyi¹ (AUTHOR), Jaikham, Jirapa¹ (AUTHOR), Knight, Bridget M.¹ (AUTHOR), Kodjak, Nikita S.³ (AUTHOR), Lengyel, Adazsofia⁵ (AUTHOR), Muñoz, Brenda L.³ (AUTHOR), Patterson, Justin T.³ (AUTHOR)

Publikováno v: Plants, People, Planet. Jan2025, Vol. 7 Issue 1, p133-146. 14p.