All a b c d e f g h i j k l m n o p q r s t u v w x y z Other

Previous Page 6 Next

Displaying 101 – 120 of 164

Showing per page

On kaleidoscopic pseudo-randomness of finite Euclidean graphs

Le Anh Vinh (2012)

Discussiones Mathematicae Graph Theory

D. Hart, A. Iosevich, D. Koh, S. Senger and I. Uriarte-Tuero (2008) showed that the distance graphs has kaleidoscopic pseudo-random property, i.e. sufficiently large subsets of d-dimensional vector spaces over finite fields contain every possible finite configurations. In this paper we study the kaleidoscopic pseudo-randomness of finite Euclidean graphs using probabilistic methods.

Poisson convergence of numbers of vertices of a given degree in random graphs

Wojciech Kordecki (1996)

Discussiones Mathematicae Graph Theory

The asymptotic distributions of the number of vertices of a given degree in random graphs, where the probabilities of edges may not be the same, are given. Using the method of Poisson convergence, distributions in a general and particular cases (complete, almost regular and bipartite graphs) are obtained.

Currently displaying 101 – 120 of 164