On graphs with randomly deleted edges
From MaRDI portal
Publication:3968971
DOI10.1007/BF01904874zbMath0503.05056MaRDI QIDQ3968971
Publication date: 1981
Published in: Acta Mathematica Academiae Scientiarum Hungaricae (Search for Journal in Brave)
connected components; spanning tree; complete graph; forest; operations on graphs; complete regular r-partite graph
05C05: Trees
05C80: Random graphs (graph-theoretic aspects)
60C05: Combinatorial probability
05C40: Connectivity
Related Items
Spectral condition for Hamiltonicity of a graph, Graph homomorphisms between trees, On a poset of trees, Undirected simple connected graphs with minimum number of spanning trees, On a conjecture of V. Nikiforov, Reliability polynomials can cross twice, Reliability covering problems for hypergraphs, Solution to a conjecture on the maximum skew-spectral radius of odd-cycle graphs, Walks and paths in trees, A survey of some network reliability analysis and synthesis results, Connectivity of finite anisotropic random graphs and directed graphs
Cites Work