Graph vulnerability parameters, compression, and quasi-threshold graphs
type: Item
instance of: scholarly article
title: Graph vulnerability parameters, compression, and quasi-threshold graphs
zbMATH Open document ID: 1407.05199
author: Nathan Kahl
published in: Discrete Applied Mathematics
publication date: 2019-03-28T00:00:00Z
Mathematics Subject Classification ID: 05C76
Mathematics Subject Classification ID: 05C40
zbMATH DE Number: 7044576
zbMATH Keywords: compression
zbMATH Keywords: integrity
zbMATH Keywords: tenacity
zbMATH Keywords: component order connectivity
zbMATH Keywords: threshold graphs
zbMATH Keywords: quasi-threshold graphs
MaRDI profile type: Publication
full work available at URL: j.dam.2018.12.004
OpenAlex ID: W2906459486
cites work: A survey of integrity
cites work: Q3789603
cites work: Q4489250
cites work: Least reliable networks and the reliability domination
cites work: Undirected simple connected graphs with minimum number of spanning trees
cites work: Q4398864
cites work: Network transformations and bounding network reliability
cites work: Q4320671
cites work: Q4871072
cites work: On a conjecture of V. Nikiforov
cites work: Applications of the Kelmans transformation: extremality of the threshold graphs
cites work: Extremal graphs for homomorphisms
cites work: Extremal Graphs for Homomorphisms II
cites work: Graphs with the maximum or minimum number of 1-factors
cites work: On graphs with randomly deleted edges
cites work: Graphs with the fewest matchings
cites work: Rupture degree of graphs
cites work: Threshold graphs and related topics
cites work: Q4503106
cites work: A reliability-improving graph transformation with applications to network reliability
Wikidata QID: Q128715707
DOI: 10.1016/J.DAM.2018.12.004
description: scientific article; zbMATH DE number 7044576