1 citations · 2 across the 9 of their papers we have counts for
10 papers
Wild number for spanning trees in complete and complete bipartite graphs
Aleyah Dawkins, Alexander Nappo, Jessie Tong +1
Given an edge-colored graph, the wild number measures how close the graph is to having a spanning tree in every color. We investigate this parameter for complete graphs and complet…
Maximizing the number of cliques in -free graphs with forbidden properties
Aleyah Dawkins, Rachel Kirsch
Ferrero and Lesniak in 2018 found the maximum numbers of edges in -partite non-Hamiltonian graphs. Recently we found the maximum numbers of edges and -cliques in -fr…
Radio gracefulness of Moore graphs and beyond
An Cao, Aleyah Dawkins, Julian Hutchins +1
The study of radio graceful labelings is motivated by modeling efficient frequency assignment to radio towers, cellular towers, and satellite networks. For a simple, connected grap…
Combinatorics of generalized parking-function polytopes
Margaret M. Bayer, Steffen Borgwardt, Teressa Chambers +8
For , a -parking function is defined to be a sequence of positive integers whose nondecreasing rearra…
On the Lucky and Displacement Statistics of Stirling Permutations
Laura Colmenarejo, Aleyah Dawkins, Jennifer Elder +5
Stirling permutations are parking functions, and we investigate two parking function statistics in the context of these objects: lucky cars and displacement. Among our results, we…
A Ricci flow on graphs from effective resistance
Aleyah Dawkins, Vishal Gupta, Mark Kempton +4
In this paper, we introduce a new notion of curvature on the edges of a graph that is defined in terms of effective resistances. We call this the Ricci--Foster curvature. We study…
Node resistance curvature in Cartesian graph products
Aleyah Dawkins, Vishal Gupta, Mark Kempton +4
Devriendt and Lambiotte recently introduced the \emph{node resistance curvature}, a notion of graph curvature based on the effective resistance matrix. In this paper, we begin the…
Edge-Disjoint Spanning Trees on Star-Product Networks
Kelly Isham, Laura Monroe, Kartik Lakhotia +3
A star-product operation may be used to create large graphs from smaller factor graphs. Network topologies based on star-products demonstrate several advantages including low-diame…
On locally finite ordered rooted trees and their rooted subtrees
Geir Agnarsson, Elie Alhajjar, Aleyah Dawkins
In this article we compare the known dynamical polynomial time algorithm for the game-over attack strategy, to that of the brute force approach; of checking all the ordered rooted…
Ore plus Turán
Aleyah Dawkins, Rachel Kirsch
Ore in 1961 determined the maximum number of edges in graphs not containing a Hamiltonian cycle, and Turán in 1941 found the maximum number of edges in graphs not containing a $K_{…