Remarks on Dynamic Monopolies with Given Average Thresholds

• Autorzy: Carmen C. Centeno , Dieter Rautenbach
• Języki publikacji: EN

Abstrakty

EN

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 concerning dynamic monopolies in graphs of given average threshold values extending and generalizing previous results of Khoshkhah et al. [On dynamic monopolies of graphs: The average and strict majority thresholds, Discrete Optimization 9 (2012) 77-83] and Zaker [Generalized degeneracy, dynamic monopolies and maximum degenerate subgraphs, Discrete Appl. Math. 161 (2013) 2716-2723].

Słowa kluczowe

EN

dynamic monopoly; degenerate set; vertex cover; independent set

• Wydawca: De Gruyter Open
• Czasopismo: Discussiones Mathematicae Graph Theory
• Rocznik: 2015
• Tom: 35
• Numer: 1
• Strony: 133-140

Daty

wydano

2015-02-01

otrzymano

2013-09-05

poprawiono

2014-03-18

zaakceptowano

2014-03-18

online

2015-02-06

Twórcy

autor

Carmen C. Centeno

• Pontifícia Universidade Católica de Goías Goías, Brazil

autor

Dieter Rautenbach

• Institute of Optimization and Operations Research Ulm University, Ulm, Germany

Bibliografia

• [1] N. Alon, J. Kahn and P.D. Seymour, Large induced degenerate subgraphs, Graphs Combin. 3 (1987) 203-211. doi:10.1007/BF01788542[Crossref]
• [2] N. Alon, D. Mubayi and R. Thomas, Large induced forests in sparse graphs, J. Graph Theory 38 (2001) 113-123. doi:10.1002/jgt.1028[Crossref]
• [3] P. Borowiecki, F. G¨oring, J. Harant and D. Rautenbach, The potential of greed for independence, J. Graph Theory 71 (2012) 245-259. doi:10.1002/jgt.20644[Crossref]
• [4] R.L. Brooks, On colouring the nodes of a network, Proc. Cambridge Philos. Soc. 37 (1941) 194-197. doi:10.1017/S030500410002168X[Crossref]
• [5] Y. Caro, New results on the independence number, Technical Report, Tel-Aviv University, 1979.
• [6] K. Khoshkhah, H. Soltani and M. Zaker, On dynamic monopolies of graphs: The average and strict majority thresholds, Discrete Optimization 9 (2012) 77-83. doi:10.1016/j.disopt.2012.02.001[WoS][Crossref]
• [7] V.K. Wei, A lower bound on the stability number of a simple graph, Technical Memorandum, TM 81-11217-9, Bell Laboratories, 1981.
• [8] M. Zaker, Generalized degeneracy, dynamic monopolies and maximum degenerate subgraphs, Discrete Appl. Math. 161 (2013) 2716-2723. doi:10.1016/j.dam.2013.04.012 [WoS][Crossref]

Identyfikatory

DOI

10.7151/dmgt.1788