On the diameter of Kronecker graphs
Combinatorics
2016-03-18 v1
Abstract
It is shown that a.a.s. as soon as a Kronecker graph becomes connected its diameter is bounded by a constant.
Keywords
Cite
@article{arxiv.1603.05408,
title = {On the diameter of Kronecker graphs},
author = {Tomasz Łuczak and Justyna Tabor},
journal= {arXiv preprint arXiv:1603.05408},
year = {2016}
}
Comments
14 pages