Journal of Graph Theory
Journal of Combinatorial Theory Series A
On power-law relationships of the Internet topology
Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
A random graph model for massive graphs
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Proceedings of the 9th international World Wide Web conference on Computer networks : the international journal of computer and telecommunications netowrking
Random evolution in massive graphs
Handbook of massive data sets
Random Structures & Algorithms
Journal of Combinatorial Theory Series A
The web as a graph: measurements, models, and methods
COCOON'99 Proceedings of the 5th annual international conference on Computing and combinatorics
Conductance and congestion in power law graphs
SIGMETRICS '03 Proceedings of the 2003 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Quasi-Randomness and Algorithmic Regularity for Graphs with General Degree Distributions
SIAM Journal on Computing
Diversity dynamics in online networks
Proceedings of the 23rd ACM conference on Hypertext and social media
Modularity spectra, eigen-subspaces, and structure of weighted graphs
European Journal of Combinatorics
| Hi-index | 0.00 |
It is now known that many properties of the objects in certain combinatorial structures are equivalent, in the sense that any object possessing any of the properties must of necessity possess them all. These properties, termed quasirandom, have been described for a variety of structures such as graphs, hypergraphs, tournaments, Boolean functions, and subsets of Zn, and most recently, sparse graphs. In this article, we extend these ideas to the more complex case of graphs which have a given degree sequence. © 2007 Wiley Periodicals, Inc. Random Struct. Alg., 2008