On the maximum size of resistant subgraphs in graphs with given average threshold
From MaRDI portal
Publication:4576358
zbMATH Open1395.05122MaRDI QIDQ4576358FDOQ4576358
Authors: Mitra Nemati Andavari, Manouchehr Zaker 
Publication date: 12 July 2018
Recommendations
- On the Largest Dynamic Monopolies of Graphs with a Given Average Threshold
- On dynamic monopolies of graphs with general thresholds
- Dynamic monopolies for degree proportional thresholds in connected graphs of girth at least five and trees
- On dynamic monopolies of graphs: the average and strict majority thresholds
- \(k\)-resistant colorings
Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Vertex degrees (05C07)
This page was built for publication: On the maximum size of resistant subgraphs in graphs with given average threshold
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4576358)
