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 componentsspanning treecomplete graphforestoperations on graphscomplete regular r-partite graph
Trees (05C05) Random graphs (graph-theoretic aspects) (05C80) Combinatorial probability (60C05) Connectivity (05C40)
Related Items (45)
Walks and paths in trees ⋮ Reliability polynomials can cross twice ⋮ Ordering starlike trees by the totality of their spectral moments ⋮ Connectivity of finite anisotropic random graphs and directed graphs ⋮ On sufficient spectral radius conditions for Hamiltonicity ⋮ Extremal graphs for the Tutte polynomial ⋮ Eigenvalue monotonicity of \(q\)-Laplacians of trees along a poset ⋮ A simple proof of the Gross‐Saccoman multigraph conjecture ⋮ On maximum graphs in Tutte polynomial posets ⋮ Fast reliability ranking of matchstick minimal networks ⋮ Spectral analogues of Erdős’ and Moon–Moser’s theorems on Hamilton cycles ⋮ Dr. Charles L. Suffel: Scholar, teacher, mentor, friend ⋮ Uniformly optimally reliable graphs: A survey ⋮ Network reliability: Heading out on the highway ⋮ <scp>M</scp>ost reliable two‐terminal graphs with node failures ⋮ The Number of Cliques in Graphs Covered by Long Cycles ⋮ Sufficient spectral conditions for graphs being k-edge-Hamiltonian or k-Hamiltonian ⋮ Complete signed graphs with largest maximum or smallest minimum eigenvalue ⋮ Extremal trees and unicyclic graphs with respect to spectral radius of weighted adjacency matrices with property \(P^*\) ⋮ More reliable graphs are not always stronger ⋮ Uniformly most reliable three-terminal graph of dense graphs ⋮ Graph homomorphisms between trees ⋮ Spectral radius and Hamiltonian properties of graphs, II ⋮ A strengthening of Erdős-Gallai theorem and proof of Woodall's conjecture ⋮ Reliability covering problems for hypergraphs ⋮ Graph vulnerability parameters, compression, and threshold graphs ⋮ Graph vulnerability parameters, compression, and quasi-threshold graphs ⋮ Network reliability in Hamiltonian graphs ⋮ Nonexistence of uniformly most reliable two-terminal graphs ⋮ Signless Laplacian spectral conditions for Hamilton-connected graphs with large minimum degree ⋮ Further results on the largest matching root of unicyclic graphs ⋮ On a poset of trees ⋮ 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 ⋮ A survey of some network reliability analysis and synthesis results ⋮ The Nordhaus-Gaddum type inequalities of \(A_\alpha \)-matrix ⋮ Sufficient spectral radius conditions for Hamilton-connectivity of \(k\)-connected graphs ⋮ Sufficient conditions for Hamilton-connected graphs in terms of (signless Laplacian) spectral radius ⋮ Undirected simple connected graphs with minimum number of spanning trees ⋮ Classes of uniformly most reliable graphs for all-terminal reliability ⋮ On a conjecture of V. Nikiforov ⋮ Solution to a conjecture on the maximum skew-spectral radius of odd-cycle graphs ⋮ Spectral and extremal conditions for supereulerian graphs ⋮ Spectral condition for Hamiltonicity of a graph ⋮ The generalized Turán number of spanning linear forests
Cites Work
This page was built for publication: On graphs with randomly deleted edges
