2018/01/16 by Jan Bok, Bok, Jan
Computer Science · Mathematics · #Combinatorics (math.CO) #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #FOS: Mathematics #Limits and Structures in Graph Theory #Mathematical Dynamics and Fractals #Topological and Geometric Data Analysis
paper · pdf · doi:10.48550/arxiv.1801.05498
openalex publication_date 2018/01/16 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
We investigate the paramater of the average range of M-Lipschitz mapping of a given graph. We focus on well-known classes such as paths, complete graphs, complete bipartite graphs and cycles and show closed formulas for computing this parameter and also we conclude asymptotics of this parameter on these aforementioned classes.