Geodesic
Random threshold graphs
The electronic journal of combinatorics, Tome 16 (2009) no. 1
Cet article a éte moissonné depuis la source The Electronic Journal of Combinatorics website

Voir la notice de l'article

We introduce a pair of natural, equivalent models for random threshold graphs and use these models to deduce a variety of properties of random threshold graphs. Specifically, a random threshold graph $G$ is generated by choosing $n$ IID values $x_1,\ldots,x_n$ uniformly in $[0,1]$; distinct vertices $i,j$ of $G$ are adjacent exactly when $x_i + x_j \ge 1$. We examine various properties of random threshold graphs such as chromatic number, algebraic connectivity, and the existence of Hamiltonian cycles and perfect matchings.
DOI : 10.37236/219
Classification : 05C80, 05C62
Mots-clés : chromatic number, algebraic connectivity, Hamiltonian cycles, perfect matchings 
@article{10_37236_219,
     author = {Elizabeth Perez Reilly and Edward R. Scheinerman},
     title = {Random threshold graphs},
     journal = {The electronic journal of combinatorics},
     year = {2009},
     volume = {16},
     number = {1},
     doi = {10.37236/219},
     zbl = {1230.05263},
     url = {http://geodesic.mathdoc.fr/articles/10.37236/219/}
}
TY  - JOUR
AU  - Elizabeth Perez Reilly
AU  - Edward R. Scheinerman
TI  - Random threshold graphs
JO  - The electronic journal of combinatorics
PY  - 2009
VL  - 16
IS  - 1
UR  - http://geodesic.mathdoc.fr/articles/10.37236/219/
DO  - 10.37236/219
ID  - 10_37236_219
ER  - 
%0 Journal Article
%A Elizabeth Perez Reilly
%A Edward R. Scheinerman
%T Random threshold graphs
%J The electronic journal of combinatorics
%D 2009
%V 16
%N 1
%U http://geodesic.mathdoc.fr/articles/10.37236/219/
%R 10.37236/219
%F 10_37236_219
Elizabeth Perez Reilly; Edward R. Scheinerman. Random threshold graphs. The electronic journal of combinatorics, Tome 16 (2009) no. 1. doi: 10.37236/219

Cité par Sources :