Graph vulnerability parameters, compression, and threshold graphs

DOI10.1016/J.DAM.2020.12.025MaRDI QIDQ2223690zbMATH OpenOpenAlexFDO

Authors 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

binding numberedge toughnessgraph compressionscattering numberthreshold graphstoughness

Mathematics Subject Classification ID

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

Recommendations

• Graph vulnerability parameters, compression, and quasi-threshold graphs
• Extremal graphs for the Tutte polynomial
• scientific article; zbMATH DE number 4053662
• scientific article; zbMATH DE number 1339493
• Stability theorems for graph vulnerability parameters

Cites work

• A reliability-improving graph transformation with applications to network reliability
• Applications of the Kelmans transformation: extremality of the threshold graphs
• Chordal 2-connected graphs and spanning trees
• Connectivity and edge-disjoint spanning trees
• Extremal graphs for homomorphisms
• Extremal graphs for homomorphisms. II
• Graph vulnerability parameters, compression, and quasi-threshold graphs
• Graphs with the fewest matchings
• Graphs with the maximum or minimum number of 1-factors
• scientific article; zbMATH DE number 1179517 (Why is no real title available?)
• Least reliable networks and the reliability domination
• Network transformations and bounding network reliability
• On a class of posets and the corresponding comparability graphs
• On a conjecture of V. Nikiforov
• On graphs with randomly deleted edges
• On Hamilton's ideals
• The binding number of a graph and its Anderson number
• Threshold graphs and related topics
• Undirected simple connected graphs with minimum number of spanning trees

Cited in

(6)

• Graph vulnerability parameters, compression, and quasi-threshold graphs
• A metric to compare vulnerability of the graphs of different sizes
• Extremal graphs for the Tutte polynomial
• Vulnerability Measures of Transformation Graph G^xy+
• Dr. Charles L. Suffel: Scholar, teacher, mentor, friend
• On topological indices, graph compression, and threshold graphs

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2223690)