Remarks on Dynamic Monopolies with Given Average Thresholds
Dynamic monopolies in graphs have been studied as a model for spreading processes within networks. Together with their dual notion, the generalized degenerate sets, they form the immediate generalization of the classical notions of vertex covers and independent sets in a graph. We present results co...
Main Authors: | Centeno Carmen C., Rautenbach Dieter |
---|---|
Format: | Article |
Language: | English |
Published: |
University of Zielona Góra
2015-02-01
|
Series: | Discussiones Mathematicae Graph Theory |
Subjects: | |
Online Access: | https://doi.org/10.7151/dmgt.1788 |
Similar Items
-
New Concepts of Vertex Covering in Cubic Graphs with Its Applications
by: Huiqin Jiang, et al.
Published: (2022-01-01) -
Bounds on the Clique and the Independence Number for Certain Classes of Graphs
by: Valentin E. Brimkov, et al.
Published: (2024-01-01) -
Dominating Vertex Covers: The Vertex-Edge Domination Problem
by: Klostermeyer William F., et al.
Published: (2021-02-01) -
Edge Dominating Sets and Vertex Covers
by: Dutton Ronald, et al.
Published: (2013-05-01) -
Solving Some Graph Problems in Composite 3D Printing Using Spreadsheet Modeling
by: Larysa Hlinenko, et al.
Published: (2023-07-01)