Louis V. Quintas

Learn More
A random recursive forest is defined as a union of random recursive trees. We find the expected number of trees in the uniform random recursive forest as well as the number of vertices of given degree, the maximum degree, the height of vertices, the order of branches, the root of the component containing a given vertex, and the last root of such forests.
A graph theory model and its invariants are used to compare previously published renal glomerular networks of six adult rats, one adult uremic rat, and one newborn rat. Invariants calculated include order, size, cycle rank, eccentricity, root distance, planarity, and vertex degree distribution. These invariants enabled the differentiation of six normal(More)