Graph vulnerability parameters, compression, and threshold graphs

DOI10.1016/j.dam.2020.12.025zbMath1466.05189OpenAlexW4206991341MaRDI QIDQ2223690

Nathan Kahl

Publication date: 1 February 2021

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2020.12.025

zbMATH Keywords

toughnessthreshold graphsgraph compressionscattering numberbinding numberedge toughness

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Graph operations (line graphs, products, etc.) (05C76)

Related Items (2)

Extremal graphs for the Tutte polynomial ⋮ Dr. Charles L. Suffel: Scholar, teacher, mentor, friend

Cites Work

• Unnamed Item
• Graphs with the fewest matchings
• Applications of the Kelmans transformation: extremality of the threshold graphs
• Graphs with the maximum or minimum number of 1-factors
• Undirected simple connected graphs with minimum number of spanning trees
• On a conjecture of V. Nikiforov
• On a class of posets and the corresponding comparability graphs
• Graph vulnerability parameters, compression, and quasi-threshold graphs
• Connectivity and edge-disjoint spanning trees
• Threshold graphs and related topics
• On Hamilton's ideals
• On graphs with randomly deleted edges
• Least reliable networks and the reliability domination
• A reliability-improving graph transformation with applications to network reliability
• Extremal graphs for homomorphisms
• Network transformations and bounding network reliability
• Extremal Graphs for Homomorphisms II
• Chordal 2‐Connected Graphs and Spanning Trees
• The binding number of a graph and its Anderson number

This page was built for publication: Graph vulnerability parameters, compression, and threshold graphs