王维凡

professor  

Gender : Male

Alma Mater : 南京大学

Education Level : Graduate student graduate

Degree : Doctorate

Status : 退休

School/Department : 数学科学学院

Date of Employment : 2002-05-01


Paper achievements

The surviving rate of an infected network.

Hits :

First Author : Wang,Weifan

Affiliation of Author(s): 数理与信息工程学院

Date of Publication : 2010-01-01

Document Type : 期刊

Journal : Theoretical Computer Science

Volume: Vol.411

Issue : No.40-42

Page Number : 3651-3660

ISSN : 0304-3975

Translation or Not : no

Key Words : Fire;extinguishers;Graph;theory;Graphic;methods;Viruses

Abstract : Let be a connected network. Let be an integer. Suppose that a vertex of becomes infected. A program is then installed on -nodes not yet infected. Afterwards, the virus spreads to all its unprotected neighbors in each time interval. The virus and the netwo

Pre One : On the vertex-arboricity of planar graphs without 7-cycles

Next One : Some results on the injective chromatic number of graphs

Recommend this Article