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 radius and Hamiltonian properties of graphs, II, Spectral and extremal conditions for supereulerian graphs, Uniformly most reliable three-terminal graph of dense graphs, Spectral condition for Hamiltonicity of a graph, Graph homomorphisms between trees, Further results on the largest matching root of unicyclic graphs, 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, Graph vulnerability parameters, compression, and quasi-threshold graphs, Reliability covering problems for hypergraphs, Signless Laplacian spectral conditions for Hamilton-connected graphs with large minimum degree, Spectral analogues of Erdős' theorem on Hamilton-connected graphs, Trees with extremal spectral radius of weighted adjacency matrices among trees weighted by degree-based indices, Sufficient spectral radius conditions for Hamilton-connectivity of \(k\)-connected graphs, The generalized Turán number of spanning linear forests, Ordering starlike trees by the totality of their spectral moments, A strengthening of Erdős-Gallai theorem and proof of Woodall's conjecture, Graph vulnerability parameters, compression, and threshold graphs, Network reliability in Hamiltonian graphs, Nonexistence of uniformly most reliable two-terminal graphs, The Nordhaus-Gaddum type inequalities of \(A_\alpha \)-matrix, Sufficient conditions for Hamilton-connected graphs in terms of (signless Laplacian) spectral radius, Classes of uniformly most reliable graphs for all-terminal reliability, Solution to a conjecture on the maximum skew-spectral radius of odd-cycle graphs, Eigenvalue monotonicity of \(q\)-Laplacians of trees along a poset, On sufficient spectral radius conditions for Hamiltonicity, Extremal graphs for the Tutte polynomial, Walks and paths in trees, Spectral analogues of Erdős’ and Moon–Moser’s theorems on Hamilton cycles, A survey of some network reliability analysis and synthesis results, Connectivity of finite anisotropic random graphs and directed graphs
Cites Work
