Skip to search formSkip to main contentSkip to account menu

Random regular graph

A random r-regular graph is a graph selected from , which denotes the probability space of all r-regular graphs on n vertices, where 3 ≤ r < n and… 
Wikipedia (opens in a new tab)

Related topics

Related topics

5 relations
Connectivity (graph theory)Graph (discrete mathematics)Graph theoryMultigraph

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2018
2018
Fast and Efficient Distributed Computation of Hamiltonian Cycles in Random Graphs
We present fast and efficient randomized distributed algorithms to find Hamiltonian cycles in random graphs. In particular, we… 
2016
2016
Non-ergodic phases in strongly disordered random regular graphs
B. L. Altshuler, E. Cuevas, L. B. Ioffe, 4 and V. E. Kravtsov 4 Physics Department, Columbia University, 538 West 120th Street… 
2016
2016
Modularity of tree-like and random regular graphs
Clustering algorithms for large networks typically use the modularity score to compare which partitions better represent modular… 
2015
2015
Learning Random Regular Graphs
The family of random regular graphs is a classic topic in the realms of graph theory, combinatorics and computer science. In this… 
2012
2012
Shortest-Weight Paths in Random Regular Graphs
Consider a random regular graph with degree $d$ and of size $n$. Assign to each edge an independent and identically distributed… 
2011
2011
Exchangeable Pairs, Switchings, and Random Regular Graphs
We consider the distribution of cycle counts in a random regular graph, which is closely linked to the graph's spectral… 
2002
2002
Small k-Dominating Sets of Regular Graphs
A k-dominating set of a graph, G, is a set of vertices, D⊆ V(G), such that for every vertex v ∈ V(G), either v ∈ D or there… 
2002
2002
On the Connected Domination Number of Random Regular Graphs
A connected dominating set (CDS) of a graph, G, is a set of vertices, C ? V (G), such that every vertex in V (G) \ C is incident… 
1997
1997
Optimal Cycle Codes Constructed From Ramanujan Graphs
We aim here to show how some known Ramanujan Cayley graphs yield error-correcting codes that are asymptotically optimal in the… 
1996
1996
A Message Passing Model for Communication on Random Regular Graphs
| Randomized routing strategies are applied to avoid worst-case communication patterns on communication networks used for… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)