Product
Help
Pricing
About
Jobs
Log in
Get started
Keyword
Add to collection
d-regular graphs
Description:
Graphs in which every vertex has degree d, studied in graph theory and discrete mathematics.
Primary topic:
Advanced Graph Theory Research (24%)
Related topics:
Advanced Graph Theory Research (24%),
Limits and Structures in Graph Theory (24%),
Graph theory and applications (14%),
Complexity and Algorithms in Graphs (8%),
Graph Labeling and Dimension Problems (7%)
OpenAlex ID:
keywords/d-regular-graphs
Logarithmic Sobolev inequalities for finite Markov chains
1996
·
P. Diaconis
, L. Saloff-Coste
·
The Annals of Applied Probability
·
592
PDF
On the second eigenvalue of a graph
1991
·
A. Nilli
·
Discrete Mathematics
·
406
Graph bisection algorithms with good average case behavior
1987
·
T. N. Bui
, S. Chaudhuri
, et al.
·
COMBINATORICA
·
367
Graph expansion and the unique games conjecture
2010
·
Prasad Raghavendra
, David Steurer
·
ACM Symposium on Theory of Computing (STOC)
·
351
Generating Random Regular Graphs Quickly
1999
·
A. STEGER
, N. C. WORMALD
·
Combinatorics Probability Computing
·
300
A proof of alon's second eigenvalue conjecture
2003
·
Joel Friedman
·
ACM Symposium on Theory of Computing (STOC)
·
275
Lifts, Discrepancy and Nearly Optimal Spectral Gap*
2006
·
Yonatan Bilu
, Nathan Linial
·
COMBINATORICA
·
274
The Moore Bound for Irregular Graphs
2002
·
Noga Alon
, Shlomo Hoory
, et al.
·
Graphs and Combinatorics
·
253
Almost all regular graphs are hamiltonian
1994
·
R. W. Robinson
, N. C. Wormald
·
Random Structures and Algorithms
·
252
The Isoperimetric Number of Random Regular Graphs
1988
·
Béla Bollobás
·
European Journal of Combinatorics
·
236
PDF
The diameter of random regular graphs
1982
·
Béla Bollobás
, W. Fernandez de la Vega
·
COMBINATORICA
·
207
Counting in two-spin models on d-regular graphs
2014
·
Allan Sly
, Nike Sun
·
The Annals of Probability
·
182
The Spectrum of the Corona of Two Graphs
2007
·
S. Barik
, S. Pati
, et al.
·
SIAM Journal on Discrete Mathematics
·
179
Limits of local algorithms over sparse random graphs
2014
·
David Gamarnik
, Madhu Sudan
·
Conference on Innovations in Theoretical Computer Science
·
172
A characterization of the smallest eigenvalue of a graph
1994
·
Madhav Desai
, Vasant Rao
·
Journal of Graph Theory
·
161
PDF
Fixed-angle conjectures for the quantum approximate optimization algorithm on regular MaxCut graphs
2021
·
Jonathan Wurtz
, Danylo Lykov
·
Physical Review A
·
157
PDF
A Sequential Algorithm for Generating Random Graphs
2009
·
Mohsen Bayati
, Jeong Han Kim
, et al.
·
Algorithmica
·
155
PDF
The asymptotic connectivity of labelled regular graphs
1981
·
Nicholas C. Wormald
·
Journal of Combinatorial Theory Series B
·
152
PDF
On the second eigenvalue of random regular graphs
1987
·
Andrei Broder
, Eli Shamir
·
Annual Symposium on Foundations of Computer Science
·
136
On the hardness of sampling independent sets beyond the tree threshold
2008
·
Elchanan Mossel
, Dror Weitz
, et al.
·
Probability Theory and Related Fields
·
135
PDF
The Number of Independent Sets in a Regular Graph
2009
·
YUFEI ZHAO
·
Combinatorics Probability Computing
·
130
PDF
Random regular graphs of high degree
2001
·
Michael Krivelevich
, Benny Sudakov
, et al.
·
Random Structures and Algorithms
·
128
Sparse pseudo‐random graphs are Hamiltonian
2002
·
Michael Krivelevich
, Benny Sudakov
·
Journal of Graph Theory
·
127
Counting Paths in Graphs
1999
·
Bartholdi, Laurent
·
Archive ouverte UNIGE (University of Geneva)
·
125
Tight Bounds on the Information Rate of Secret Sharing Schemes
1997
·
Carlo Blundo
, Alfredo De Santis
, et al.
·
Designs Codes and Cryptography
·
123
Show more works
View as search
Works count:
817
Citation count:
14,650
Year
Topic
Type