Related papers: The minimum value of the Colless index
Labeling schemes seek to assign a short label to each node in a network, so that a function on two nodes can be computed by examining their labels alone. For the particular case of trees, optimal bounds (up to low order terms) were recently…
For a given graph, the unlabeled subgraphs $G-v$ are called the cards of $G$ and the deck of $G$ is the multiset $\{G-v: v \in V(G)\}$. Wendy Myrvold [Ars Combinatoria, 1989] showed that a non-connected graph and a connected graph both on…
The tree inclusion problem is, given two node-labeled trees $P$ and $T$ (the ``pattern tree'' and the ``target tree''), to locate every minimal subtree in $T$ (if any) that can be obtained by applying a sequence of node insertion operations…
The alpha model, a parametrized family of probabilities on cladograms (rooted binary leaf labeled trees), is introduced. This model is Markovian self-similar, deletion-stable (sampling consistent), and passes through the Yule, Uniform and…
A tree T is invertible if and only if T has a perfect matching. Godsil considers an invertible tree T and finds that the inverse of the adjacency matrix of T has entries in {0, 1, -1} and is the signed adjacency matrix of a graph which…
Over some types of trees with a given number of vertices, which trees minimize or maximize the total number of subtrees or leaf containing subtrees are studied. Here are some of the main results:\ (1)\, Sharp upper bound on the total number…
We consider the problem of rate and power allocation for a sensor network under the pairwise distributed source coding constraint. For noiseless source-terminal channels, we show that the minimum sum rate assignment can be found by finding…
Bounds on the log partition function are important in a variety of contexts, including approximate inference, model fitting, decision theory, and large deviations analysis. We introduce a new class of upper bounds on the log partition…
Let T be a weighted tree with n leaves. Let D_{i,j} be the distance between the leaves i and j. Let D_{i,j,k}= (D_{i,j} + D_{j,k} +D_{i,k})/2. We will call such numbers "triple weights" of the tree. In this paper, we give a…
Given two rooted, ordered, and labeled trees $P$ and $T$ the tree inclusion problem is to determine if $P$ can be obtained from $T$ by deleting nodes in $T$. This problem has recently been recognized as an important query primitive in XML…
It is well known that in a binary tree the external path length minus the internal path length is exactly 2n-2, where n is the number of external nodes. We show that a generalization of the formula holds for compacted tries, replacing the…
The treedepth of a graph $G$ is the least possible depth of an elimination forest of $G$: a rooted forest on the same vertex set where every pair of vertices adjacent in $G$ is bound by the ancestor/descendant relation. We propose an…
The harmonic index of a graph $G$, is defined as the sum of weights $\frac{2}{d(u)+d(v)}$ of all edges $uv$ of $G$, where $d(u)$ is the degree of the vertex $u$ in $G$. In this paper we find the minimum harmonic index of bicyclic graph of…
An {\em ancestry labeling scheme} labels the nodes of any tree in such a way that ancestry queries between any two nodes in a tree can be answered just by looking at their corresponding labels. The common measure to evaluate the quality of…
An L(2, 1)-labeling of a graph is an assignment of nonnegative integers to the vertices of G such that adjacent vertices receive numbers differed by at least 2, and vertices at distance 2 are assigned distinct numbers. The L(2, 1)-labeling…
In this paper, given a simple linear recurrence sequence of algebraic numbers, which has either a dominant characteristic root or exactly two characteristic roots of maximal modulus, we give some explicit lower bounds for the index beyond…
We show that the expected size of the maximum agreement subtree of two $n$-leaf trees, uniformly random among all trees with the shape, is $\Theta(\sqrt{n})$. To derive the lower bound, we prove a global structural result on a decomposition…
K. Ichihara and E. Matsudo introduced the notions of $\mathbb{Z}$-colorable links and the minimal coloring number for $\mathbb{Z}$-colorable links, which is one of invariants for links. They proved that the lower bound of minimal coloring…
Choi et. al (2011) introduced a minimum spanning tree (MST)-based method called CLGrouping, for constructing tree-structured probabilistic graphical models, a statistical framework that is commonly used for inferring phylogenetic trees.…
In this work, we present an $\Omega\left(\min\{\log \Delta, \sqrt{\log n}\}\right)$ lower bound for Maximal Matching (MM) in $\Delta$-ary trees against randomized algorithms. By a folklore reduction, the same lower bound applies to Maximal…