3 papers
math.CO2023
On large regular (1,1,k)-mixed graphs
C. Dalfó, G. Erskine, G. Exoo +4
An -mixed graph has every vertex with undirected degree , directed in- and out-degree , and diameter . In this paper, we study the case , proposing som…
math.CO2023
Mutually avoiding Eulerian circuits
Grahame Erskine, Terry Griggs, Robert Lewis +1
Two Eulerian circuits, both starting and ending at the same vertex, are avoiding if at every other point of the circuits they are at least distance 2 apart. An Eulerian graph which…
math.CO2023
The maximum Wiener index of a uniform hypergraph
Stijn Cambie, Ervin Győri, Nika Salia +2
The Wiener index of a (hyper)graph is calculated by summing up the distances between all pairs of vertices. We determine the maximum possible Wiener index of a connected -vertex…