Načítá se...

Quasi-random graphs

We introduce a large equivalence class of graph properties, all of which are shared by so-called random graphs. Unlike random graphs, however, it is often relatively easy to verify that a particular family of graphs possesses some property in this class.

Uloženo v:
Podrobná bibliografie
Hlavní autoři: Chung, F. R. K., Graham, R. L., Wilson, R. M.
Médium: Artigo
Jazyk:Inglês
Vydáno: 1988
Témata:
On-line přístup:https://ncbi.nlm.nih.gov/pmc/articles/PMC279681/
https://ncbi.nlm.nih.gov/pubmed/16593909
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo otaguje tento záznam!