A note on the warmth of random graphs with given expected degrees
From MaRDI portal
Publication:2330255
DOI10.1155/2014/749856zbMath1486.05281OpenAlexW1994965395WikidataQ59044309 ScholiaQ59044309MaRDI QIDQ2330255
Publication date: 28 October 2019
Published in: International Journal of Mathematics and Mathematical Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1155/2014/749856
Small world graphs, complex networks (graph-theoretic aspects) (05C82) Random graphs (graph-theoretic aspects) (05C80) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Coloring of graphs and hypergraphs (05C15) Vertex degrees (05C07)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The concentration of the chromatic number of random graphs
- Eigenvalues of random power law graphs
- Connected components in random graphs with given expected degree sequences
- The spectral gap of random graphs with given expected degrees
- A remark on the spectra of random graphs with given expected degrees
- Large dicliques in a directed inhomogeneous random graph
- Multi-Type Directed Scale-Free Percolation
- The Volume of the Giant Component of a Random Graph with Given Expected Degrees
- The Average Distance in a Random Graph with Given Expected Degrees
- Every monotone graph property has a sharp threshold
- On the Chromatic Number of Random Graphs with a Fixed Degree Sequence
- Non-Hyperbolicity of Random Graphs with Given Expected Degrees
This page was built for publication: A note on the warmth of random graphs with given expected degrees