We study the coefficients of algebraic functions∑ n≥ 0fnzn. First, we recall the too-little-
known fact that these coefficients fn always admit a closed form. Then we study their …

Stack-triangulations appear as natural objects when one wants to define some families of
increasing triangulations by successive additions of faces. We investigate the asymptotic …

In this work, we analyze fundamental properties of random Apollonian networks [Zhang et al.
06, Zhou et al. 05], a popular random graph model that generates planar graphs with power …

A set W⊆ V (G) is called a resolving set, if for each pair of distinct vertices u, v∈ V (G) there
exists t∈ W such that d (u, t)≠ d (v, t), where d (x, y) is the distance between vertices x and y …

This paper studies the coefficients of algebraic functions. First, we recall the too-little-known
fact that these coefficients f_n have a closed form. Then, we study their asymptotics, known …

Mathematical and Algorithmic Analysis of Network and Biological Data Page 1 Carnegie Mellon
University Doctoral Thesis Mathematical and Algorithmic Analysis of Network and Biological …

This paper examines the distances between vertices in a rooted k-tree, for a fixed k, by
exhibiting a correspondence with a variety of trees that can be specified in terms of …

In this article, we investigate several properties of high-dimensional random Apollonian
networks, including two types of degree profiles, the small-world effect (clustering property) …

We study heavy subtrees of conditional Galton-Watson trees. In a standard Galton-Watson
tree conditional on its size being n, we order all children by their subtree sizes, from large …

In this paper, we define distance partition of vertex set of a graph G with reference to a vertex
in it and with the help of the same, a graph with metric dimension two (ie β (G)= 2) is …