Graph-indexed random walks on special classes of graphs

01/16/2018
by   Jan Bok, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
02/08/2022

Defective incidence coloring of graphs

We define the d-defective incidence chromatic number of a graph, general...
research
06/02/2021

Stability of Special Graph Classes

Frei et al. [6] showed that the problem to decide whether a graph is sta...
research
07/28/2020

Injective hulls of various graph classes

A graph is Helly if its disks satisfy the Helly property, i.e., every fa...
research
08/08/2019

Efficient Generation of Different Topological Representations of Graphs Beyond-Planarity

Beyond-planarity focuses on combinatorial properties of classes of non-p...
research
09/11/2019

Independent Domination in Directed Graphs

In this paper we initialize the study of independent domination in direc...
research
05/08/2022

Orientations and cycles in supersingular isogeny graphs

The paper concerns several theoretical aspects of oriented supersingular...
research
02/25/2022

Making Life More Confusing for Firefighters

It is well known that fighting a fire is a hard task. The Firefighter pr...

Please sign up or login with your details

Forgot password? Click here to reset