{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,6]],"date-time":"2025-11-06T12:12:53Z","timestamp":1762431173114},"reference-count":6,"publisher":"World Scientific Pub Co Pte Lt","issue":"04","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int. J. Found. Comput. Sci."],"published-print":{"date-parts":[[2016,6]]},"abstract":"<jats:p> Let G be a connected graph. A set of vertices [Formula: see text] is called subverted from G if each of the vertices in S and the neighbor of S in G are deleted from G. By G\/S we denote the survival subgraph that remains after S is subverted from G. A vertex set S is called a cut-strategy of G if G\/S is disconnected, a clique, or \u00f8. The vertex-neighbor-scattering number of G is defined by [Formula: see text], where S is any cut-strategy of G, and \u00f8(G\/S) is the number of components of G\/S. It is known that this parameter can be used to measure the vulnerability of spy networks and the computing problem of the parameter is NP-complete. In this paper, we discuss the vertex-neighbor-scattering number of bipartite graphs. The NP-completeness of the computing problem of this parameter is proven, and some upper and lower bounds of the parameter are also given. <\/jats:p>","DOI":"10.1142\/s012905411650012x","type":"journal-article","created":{"date-parts":[[2016,7,7]],"date-time":"2016-07-07T07:21:04Z","timestamp":1467876064000},"page":"501-509","source":"Crossref","is-referenced-by-count":1,"title":["Vertex-Neighbor-Scattering Number of Bipartite Graphs"],"prefix":"10.1142","volume":"27","author":[{"given":"Zongtian","family":"Wei","sequence":"first","affiliation":[{"name":"School of Science, Xi'an University of Architecture and Technology, Xi'an, Shaanxi 710055, P. R. China"}]},{"given":"Nannan","family":"Qi","sequence":"additional","affiliation":[{"name":"Science and Technology Laboratory, Luoyang Institute of Electro-Optic Equipment, Luoyang, Henan 471009, P. R. China"}]},{"given":"Xiaokui","family":"Yue","sequence":"additional","affiliation":[{"name":"School of Astronautics, Northwestern Polytechnical University, Xi'an, Shaanxi 710072, P. R. China"}]}],"member":"219","published-online":{"date-parts":[[2016,7,7]]},"reference":[{"key":"p_2","doi-asserted-by":"publisher","DOI":"10.1016\/0166-218X(85)90075-7"},{"key":"p_3","first-page":"105","volume":"54","author":"Gunther G.","year":"1986","journal-title":"Congr. Numer."},{"key":"p_4","first-page":"149","volume":"29","author":"Wu S.-S. Y.","year":"1990","journal-title":"Ars Combin."},{"key":"p_5","first-page":"169","volume":"43","author":"Cozzens M. B.","year":"1996","journal-title":"Ars Combin."},{"key":"p_6","first-page":"417","volume":"102","author":"Wei Z.","year":"2011","journal-title":"Ars Combin."},{"key":"p_10","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(84)90126-1"}],"container-title":["International Journal of Foundations of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S012905411650012X","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,7]],"date-time":"2019-08-07T17:32:36Z","timestamp":1565199156000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S012905411650012X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,6]]},"references-count":6,"journal-issue":{"issue":"04","published-online":{"date-parts":[[2016,7,7]]},"published-print":{"date-parts":[[2016,6]]}},"alternative-id":["10.1142\/S012905411650012X"],"URL":"https:\/\/doi.org\/10.1142\/s012905411650012x","relation":{},"ISSN":["0129-0541","1793-6373"],"issn-type":[{"value":"0129-0541","type":"print"},{"value":"1793-6373","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,6]]}}}