In this paper, motivated by the study of the wide diameter and the Rabin number of graphs, we define the generalized k-diameter of k-connected graphs, and show that every k-regular k-connected graph ...

Some math conjectures and theorems and proofs can take on a profound, quasi-religious status as examples of the limits of human comprehension. TREE(3) is one of those examples. "You've got all these ...

We consider a special version of random sequential adsorption (RSA) with nearest-neighbor interaction on infinite tree graphs. In classical RSA, starting with a graph with initially inactive nodes, ...

Montreal, December 14, 2016 -- At this time of year, the words "Yule tree" may conjure images of brightly decorated balsam firs. But for Lea Popovic, an associate professor of mathematics and ...