3 papers
math.CO2025
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…
math.CO2025
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_…
cs.NI2025
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…