Degree sequences of random graphs
From MaRDI portal
Publication:1146197
DOI10.1016/0012-365X(81)90253-3zbMath0447.05038OpenAlexW2044231811MaRDI QIDQ1146197
Publication date: 1981
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0012-365x(81)90253-3
Related Items
ON THE MATCHING NUMBER OF AN UNCERTAIN GRAPH, Some remarks about extreme degrees in a random graph, Edge-colouring random graphs, The degree distribution of the random multigraphs, Measles dynamics on network models with optimal control strategies, Complex networks: structure and dynamics, Computational and analytical studies of the Randić index in Erdős-Rényi models, On 2-step and hop dominating sets in graphs, On the sizes of large subgraphs of the binomial random graph, Extreme degrees in random subgraphs of regular graphs, Concentration of maximum degree in random planar graphs, Degree sequence of graph operator for some standard graphs, Unnamed Item, Euler index in uncertain graph, On roman, global and restrained domination in graphs, On the distribution of the maximum \(k\)-degrees of the binomial random graph, Moderate deviations of subgraph counts in the Erdős-Rényi random graphs 𝐺(𝑛,𝑚) and 𝐺(𝑛,𝑝), Extremal Graphs with Local Covering Conditions, Quantum solutions for densest \(k\)-subgraph problems, The maximum and minimum degree of the random \(r\)-uniform \(r\)-partite hypergraphs, Euler index of uncertain random graph: concepts and properties, Average-case analysis of incremental topological ordering, Expected values of parameters associated with the minimum rank of a graph, Unnamed Item, Unnamed Item, Statistical mechanics of complex networks, On the Randić index of graphs, The distribution of the maximum number of common neighbors in the random graph, Unnamed Item, On the strength of connectedness of a random hypergraph, Connectedness strength of two vertices in an uncertain graph
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Edge disjoint placement of graphs
- On graphs with equal edge connectivity and minimum degree
- Hamiltonian circuits in random graphs
- On the chromatic index of almost all graphs
- Chromatic number, girth and maximal degree
- Turan's theorem for \(k\)-graphs
- Graph Theory and Probability
- Graph Theory and Probability. II
- On colouring random graphs
- Uniquely Colourable Graphs with Large Girth
- Cliques in random graphs
- Uniquely Partitionable Graphs
- On the probability in the tail of a binomial distribution
