IDEAS home Printed from https://ideas.repec.org/a/eee/apmaco/v283y2016icp1-5.html
   My bibliography  Save this article

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

Author

Listed:
  • Liu, Yong
  • Wei, Zongtian
  • Shi, Jiarong
  • Mai, Anchan

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.

Suggested Citation

  • Liu, Yong & Wei, Zongtian & Shi, Jiarong & Mai, Anchan, 2016. "A polynomial algorithm of edge-neighbor-scattering number of trees," Applied Mathematics and Computation, Elsevier, vol. 283(C), pages 1-5.
    • Handle: RePEc:eee:apmaco:v:283:y:2016:i:c:p:1-5
    DOI: 10.1016/j.amc.2016.02.021
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0096300316301242
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.amc.2016.02.021?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:apmaco:v:283:y:2016:i:c:p:1-5. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: https://www.journals.elsevier.com/applied-mathematics-and-computation .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.