Graph-indexed random walks on special classes of graphs
classification
🧮 math.CO
cs.DM
keywords
classesgraphscompleteparameteraforementionedasymptoticsaveragebipartite
read the original abstract
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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.