Dr. Charles L. Suffel: Scholar, teacher, mentor, friend
From MaRDI portal
Publication:6085882
DOI10.1002/net.22098zbMath1525.01039OpenAlexW4224925042MaRDI QIDQ6085882
Daniel Gross, J. T. Saccoman, Kristi Luttrell, Nathan Kahl
Publication date: 12 December 2023
Published in: Networks (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/net.22098
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Applications of the Kelmans transformation: extremality of the threshold graphs
- Graphs with the maximum or minimum number of 1-factors
- On a conjecture of V. Nikiforov
- Neighbour-connectivity in regular graphs
- A new technique for the characterization of graphs with a maximum number of spanning trees
- Chromatic polynomials with least coefficients
- On the characterization of graphs with maximum number of spanning trees
- A certain polynomial of a graph and graphs with an extremal number of trees
- Invulnerability of planar two-tree networks
- Graph vulnerability parameters, compression, and quasi-threshold graphs
- Threshold graphs and related topics
- Graph vulnerability parameters, compression, and threshold graphs
- Network reliability in Hamiltonian graphs
- Classes of uniformly most reliable graphs for all-terminal reliability
- Extremal graphs for the Tutte polynomial
- Spanning Tree Results for Graphs and Multigraphs
- A generalization of an edge-connectivity theorem of Chartrand
- A survey of some network reliability analysis and synthesis results
- Some Alternate Characterizations of Reliability Domination
- The Complexity of Enumeration and Reliability Problems
- On graphs with randomly deleted edges
- Least reliable networks and the reliability domination
- A reliability-improving graph transformation with applications to network reliability
- The spanning subgraphs of eulerian graphs
- A proof of Boesch's conjecture
- Maximizing spanning trees in almost complete graphs
- Uniformly optimally reliable graphs
- Extremal graphs for homomorphisms
- Extremal Graphs for Homomorphisms II
- On the existence of uniformly optimally reliable networks
