Graph vulnerability parameters, compression, and quasi-threshold graphs

DOI10.1016/j.dam.2018.12.004zbMath1407.05199OpenAlexW2906459486WikidataQ128715707 ScholiaQ128715707MaRDI QIDQ1735681

Nathan Kahl

Publication date: 28 March 2019

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

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

zbMATH Keywords

compressiontenacitythreshold graphsintegrityquasi-threshold graphscomponent order connectivity

Mathematics Subject Classification ID

Connectivity (05C40) Graph operations (line graphs, products, etc.) (05C76)

Related Items (3)

Extremal graphs for the Tutte polynomial ⋮ Dr. Charles L. Suffel: Scholar, teacher, mentor, friend ⋮ Graph vulnerability parameters, compression, and threshold graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• 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
• A survey of integrity
• Threshold graphs and related topics
• 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
• Rupture degree of graphs

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