4 papers
Distances in -ary recursive trees
Kiran Bhutani, Ravi Kalpathy, Florian Lesny +2
We introduce the -ary recursive tree, a tree structure that starts with a single node. At each step of the growth process, a random node, called the recruiter, is selected, and…
On The Secure Domination of Mycielskian Graphs
Kiran R. Bhutani, Anthony Christiana, Peter Ulrickson
We study the secure domination number of the Mycielskian graph of a simple, connected, undirected graph. We give generally applicable bounds, compute secure domination numbers for…
Degrees in random -ary hooking networks
Kiran R. Bhutani, Ravi Kalpathy, Hosam Mahmoud
The theme in this paper is a composition of random graphs and Pólya urns. The random graphs are generated through a small structure called the seed. Via Pólya urns, we study the as…
Random multi-hooking networks
Kiran R. Bhutani, Ravi Kalpathy, Hosam Mahmoud
We introduce a broad class of multi-hooking networks, wherein multiple copies of a seed are hooked at each step at random locations, and the number of copies follows a predetermine…