6 papers
Results on Cartesian -capacity of graphs
Mateja GraÅ¡iÄ, Christopher Mouron, AljoÅ¡a Å ubaÅ¡iÄ +2
The concept of graph capacity extends graph span by considering the maximum number of agents that can simultaneously traverse a graph while preserving a prescribed minimum distance…
Span capacities of graphs
Mateja GraÅ¡iÄ, Christopher Mouron, AljoÅ¡a Å ubaÅ¡iÄ +2
The -capacity of a graph is introduced as the maximum number of players that can simultaneously traverse such that each player visits all vertices while maintaining a di…
The Specification Property on the Lelek Fan
Goran Erceg, James Kelly, Judy Kennedy +2
Recent work of Piotr Oprocha and his collaborators has provided a number of delicate examples of dynamical systems separating specification, shadowing, and periodic-point density,…
Euclidean-type algorithm for functions with same or similar origin
Ana AnuÅ¡iÄ, Christopher Mouron
Maps are called kin if they are forward iterates of the same map , up to a composition with a commuting homeomorphism. Kin form an important cla…
Turbulent Closed Relations
Judy Kennedy, Christopher Mouron, Van Nall
This paper generalizes the classical notion of turbulence from dynamical systems generated by continuous functions to those defined by closed relations on compact metric spaces. Us…
The strong vertex span of trees
Mateja GraÅ¡iÄ, Chris Mouron, Andrej Taranenko
The strong vertex (edge) span of a given graph is the maximum distance that two players can maintain at all times while visiting all vertices (edges) of and moving either t…