Related papers: On several properties of plane-oriented recursive …
The Zagreb index, which is defined as the sum of squares of degrees of the nodes of a tree, was studied in previous works by martingale techniques for random non-plane recursive trees and classes of random trees which are close to random…
In this article, we investigate the Zagreb index, a kind of graph-based topological index, of several random networks, including a class of networks extended from random recursive trees, plain-oriented recursive trees, and random…
In this paper, we characterize the structure and topological indices of a class of random spider trees (RSTs) such as degree-based Gini index, degree-based Hoover index, generalized Zagreb index and other indices associated with these. We…
In this paper, we study the joint behaviour of the degree, depth and label of and graph distance between high-degree vertices in the random recursive tree. We generalise the results obtained by Eslava and extend these to include the labels…
A weighted recursive tree is an evolving tree in which vertices are assigned random vertex-weights and new vertices connect to a predecessor with a probability proportional to its weight. Here, we study the maximum degree and near-maximum…
In chemical graph theory, caterpillar trees have been an appealing model to represent the molecular structures of benzenoid hydrocarbon. Meanwhile, topological index has been thought of as a powerful tool for modeling quantitative…
Let $\mathcal {T}^{\Delta}_n$ denote the set of trees of order $n$, in which the degree of each vertex is bounded by some integer $\Delta$. Suppose that every tree in $\mathcal {T}^{\Delta}_n$ is equally likely. We show that the number of…
The first multiplicative Zagreb index of a graph $G$ is the product of the square of every vertex degree, while the second multiplicative Zagreb index is the product of the products of degrees of pairs of adjacent vertices. In this paper,…
In this paper, we examine a specific type of random chains and propose an unified approach to studying the degree-based topological indices, including their extreme values. We derive explicit analytical expressions for the expected values…
In this note we consider the $k$th level of the uniform random recursive tree after $n$ steps, and prove that the proportion of nodes with degree greater than $t\log n$ converges to $(1-t)^k$ almost surely, as $n\to\infty$, for every…
We show that an algorithmic construction of sequences of recursive trees leads to a direct proof of the convergence of random recursive trees in an associated Doob-Martin compactification; it also gives a representation of the limit in…
We study a general model of recursive trees where vertices are equipped with independent weights and at each time-step a vertex is sampled with probability proportional to its fitness function (a function of its weight and degree) and…
In this paper, we study uniform rooted plane trees with given degree sequence. We show, under some natural hypotheses on the degree sequence, that these trees converge toward the so-called Inhomogeneous Continuum Random Tree after…
In this paper, we investigate the structural properties of trees and bipartite graphs through the lens of topological indices and combinatorial graph theory. We focus on the First and Second Hyper-Zagreb indices, $HM_1(G)$ and $HM_2(G)$,…
Decision tree learning is increasingly being used for pointwise inference. Important applications include causal heterogenous treatment effects and dynamic policy decisions, as well as conditional quantile regression and design of…
The second Zagreb index is $M_2(G)=\sum_{uv\in E(G)}d_{G}(u)d_{G}(v)$. It was found to occur in certain approximate expressions of the total $\pi$-electron energy of alternant hydrocarbons and used by various researchers in their QSPR and…
The first multiplicative Zagreb index $\Pi_1$ of a graph $G$ is the product of the square of every vertex degree, while the second multiplicative Zagreb index $\Pi_2$ is the product of the products of degrees of pairs of adjacent vertices.…
We study the fundamental question of how likely it is that two randomly chosen trees are isomorphic to each other for different models of random trees. We show that the probability decays exponentially for rooted labeled trees as well as…
For a tree Markov random field non-reconstruction is said to hold if as the depth of the tree goes to infinity the information that a typical configuration at the leaves gives about the value at the root goes to zero. The distribution of…
A uniform recursive tree on $n$ vertices is a random tree where each possible $(n-1)!$ labeled recursive rooted tree is selected with equal probability. In this paper we introduce and study weighted trees, a non-uniform recursive tree model…