Rate of convergence of the short cycle distribution in random regular graphs generated by pegging.
The Electronic Journal of Combinatorics [electronic only] (2009)
- Volume: 16, Issue: 1, page Research Paper R44, 19 p.-Research Paper R44, 19 p.
- ISSN: 1077-8926
Access Full Article
top
How to cite
topGao, Pu, and Wormald, Nicholas. "Rate of convergence of the short cycle distribution in random regular graphs generated by pegging.." The Electronic Journal of Combinatorics [electronic only] 16.1 (2009): Research Paper R44, 19 p.-Research Paper R44, 19 p.. <http://eudml.org/doc/117507>.
@article{Gao2009,
author = {Gao, Pu, Wormald, Nicholas},
journal = {The Electronic Journal of Combinatorics [electronic only]},
keywords = {pegging algorithm},
language = {eng},
number = {1},
pages = {Research Paper R44, 19 p.-Research Paper R44, 19 p.},
publisher = {Prof. André Kündgen, Deptartment of Mathematics, California State University San Marcos, San Marcos},
title = {Rate of convergence of the short cycle distribution in random regular graphs generated by pegging.},
url = {http://eudml.org/doc/117507},
volume = {16},
year = {2009},
}
TY - JOUR
AU - Gao, Pu
AU - Wormald, Nicholas
TI - Rate of convergence of the short cycle distribution in random regular graphs generated by pegging.
JO - The Electronic Journal of Combinatorics [electronic only]
PY - 2009
PB - Prof. André Kündgen, Deptartment of Mathematics, California State University San Marcos, San Marcos
VL - 16
IS - 1
SP - Research Paper R44, 19 p.
EP - Research Paper R44, 19 p.
LA - eng
KW - pegging algorithm
UR - http://eudml.org/doc/117507
ER -
NotesEmbed ?
topYou must be logged in to post comments.
To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.