Irreversible k-threshold and majority conversion processes on complete multipartite graphs and graph products
From MaRDI portal
Publication:2848721
zbMath1276.05099arXiv1102.5361MaRDI QIDQ2848721
Denise Sakai Troxell, Sarah Spence Adams, Zachary Brass, Connor Stokes
Publication date: 26 September 2013
Full work available at URL: https://arxiv.org/abs/1102.5361
Applications of graph theory (05C90) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Graph operations (line graphs, products, etc.) (05C76)
Related Items (6)
Target set selection on generalized pancake graphs ⋮ Dynamic monopolies and feedback vertex sets in hexagonal grids ⋮ Modeling the spread of fault in majority-based network systems: dynamic monopolies in triangular grids ⋮ On reversible cascades in scale-free and Erdős-Rényi random graphs ⋮ On dynamic monopolies of graphs: the average and strict majority thresholds ⋮ Generalized degeneracy, dynamic monopolies and maximum degenerate subgraphs
This page was built for publication: Irreversible k-threshold and majority conversion processes on complete multipartite graphs and graph products
