A polynomial algorithm of edge-neighbor-scattering number of trees

Yong Liu, Zongtian Wei, Jiarong Shi and Anchan Mai

Applied Mathematics and Computation, 2016, vol. 283, issue C, 1-5

Abstract: The edge-neighbor-scattering number (ENS) is an alternative invulnerability measure of networks such as the vertices represent spies or virus carriers. Let G=(V,E) be a graph and e be any edge in G. The open edge-neighborhood of e is N(e)={f∈E(G)|f≠e,e and f are adjacent}, and the closed edge-neighborhood of e is N[e]=N(e)∪{e}. An edge e in G is said to be subverted when N[e] is deleted from G. An edge set X ⊆ E(G) is called an edge subversion strategy of G if each of the edges in X has been subverted from G. The survival subgraph is denoted by G/X. An edge subversion strategy X is called an edge-cut-strategy of G if the survival subgraph G/X is disconnected, or is a single vertex, or is ϕ. The ENS of a graph G is defined as ENS(G)=maxX⊆E(G){ω(G/X)−|X|}, where X is any edge-cut-strategy of G, ω(G/X) is the number of the components of G/X. It is proved that the problem of computing the ENS of a graph is NP-complete. In this paper, we give a polynomial algorithm of ENS of trees.

Keywords: Graph; Edge-neighbor-scattering number; Polynomial algorithm; Tree (search for similar items in EconPapers)
Date: 2016
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0096300316301242
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:apmaco:v:283:y:2016:i:c:p:1-5

DOI: 10.1016/j.amc.2016.02.021

Access Statistics for this article

Applied Mathematics and Computation is currently edited by Theodore Simos

More articles in Applied Mathematics and Computation from Elsevier
Bibliographic data for series maintained by Catherine Liu ().