On graphs with randomly deleted edges
From MaRDI portal
Cites work
- A certain polynomial of a graph and graphs with an extremal number of trees
- Comparison of graphs by their number of spanning trees
- Graphs with an extremal number of spanning trees
- scientific article; zbMATH DE number 3152798 (Why is no real title available?)
- scientific article; zbMATH DE number 3168330 (Why is no real title available?)
- scientific article; zbMATH DE number 3523603 (Why is no real title available?)
Cited in
(66)- 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
- Spectral condition for Hamiltonicity of a graph
- 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
- Graph homomorphisms between trees
- Further results on the largest matching root of unicyclic graphs
- Spectral radius and Hamiltonian properties of graphs. II
- On a poset of trees
- Spectral and extremal conditions for supereulerian graphs
- A simple proof of the Gross‐Saccoman multigraph conjecture
- On maximum graphs in Tutte polynomial posets
- Fast reliability ranking of matchstick minimal networks
- 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
- Greedy maximal independent sets via local limits
- On the construction of locally most reliable two-terminal graphs
- On the minimum spectral radius of connected graphs of given order and size
- Essential connectivity and spectral radius of graphs
- Signless Laplacian spectral conditions for the existence of rainbow k-factors in a collection of graphs
- Spectral radius and rainbow k-factors of graphs
- Rainbow Hamiltonicity with large edge numbers
- Nonexistence of uniformly most reliable graphs of least corank
- Most reliable graphs with reduced corank
- Spectral conditions for the maximum subgraph edge-connectivity of graphs
- Spectral radius of weighted adjacency matrix of trees based on Balaban index
- Extremal spectral radius and g-good r-component connectivity
- A matrix realization of spectral bounds
- Extremal results on the spectral radius of function-weighted adjacency matrices
- There are finitely many uniformly most reliable graphs of corank 5
- An algebraic characterization of strong graphs
- Rainbow Hamiltonicity and the spectral radius
- Maxima of the Q-index: forbidden rainbow Hamilton paths, matchings and linear forests
- On bipartite graphs with the minimum number of spanning trees
- Csikvári's poset and Tutte polynomial
- On topological indices, graph compression, and threshold graphs
This page was built for publication: On graphs with randomly deleted edges
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3968971)
