{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,30]],"date-time":"2025-07-30T14:09:14Z","timestamp":1753884554725,"version":"3.41.2"},"reference-count":7,"publisher":"World Scientific Pub Co Pte Ltd","issue":"04","funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11661066"],"award-info":[{"award-number":["11661066"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J. Inter. Net."],"published-print":{"date-parts":[[2021,12]]},"abstract":"<jats:p> For a given graph [Formula: see text], denote by [Formula: see text] and [Formula: see text] the order of the largest component and the number of connected components of [Formula: see text], respectively. The scattering number of [Formula: see text] is defined as [Formula: see text]. The tenacity of [Formula: see text] is defined as [Formula: see text]. These two theoretical parameters are important combinatorial parameters for measuring the vulnerability of networks. In this paper, we determine the scattering number and tenacity of [Formula: see text]-uniform linear hypergraph [Formula: see text]. <\/jats:p>","DOI":"10.1142\/s0219265921420032","type":"journal-article","created":{"date-parts":[[2021,6,21]],"date-time":"2021-06-21T04:42:41Z","timestamp":1624250561000},"source":"Crossref","is-referenced-by-count":0,"title":["The Vulnerability of k-Uniform Linear Hypergraph"],"prefix":"10.1142","volume":"21","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7474-8586","authenticated-orcid":false,"given":"Ning","family":"Zhao","sequence":"first","affiliation":[{"name":"Department of Mathematics and statistics, Qinghai Nationalities University, Xining, Qinghai 810000, P. R. China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yinkui","family":"Li","sequence":"additional","affiliation":[{"name":"Department of Mathematics and statistics, Qinghai Nationalities University, Xining, Qinghai 810000, P. R. China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"219","published-online":{"date-parts":[[2021,6,20]]},"reference":[{"volume-title":"Topics in Structural Graph Theory","year":"2013","author":"Beineke L. W.","key":"S0219265921420032BIB001"},{"key":"S0219265921420032BIB002","series-title":"North-Holland Mathematical Library","volume-title":"Graphs and Hypergraphs","volume":"6","author":"Berge C.","year":"1976","edition":"2"},{"key":"S0219265921420032BIB003","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-84628-970-5"},{"key":"S0219265921420032BIB004","doi-asserted-by":"publisher","DOI":"10.2307\/2371086"},{"key":"S0219265921420032BIB005","doi-asserted-by":"publisher","DOI":"10.1016\/0095-8956(78)90013-8"},{"key":"S0219265921420032BIB006","first-page":"111","volume-title":"Proc. 7th Int. Conf. Theory and Applications of Graphs","author":"Cozzen M.","year":"1995"},{"key":"S0219265921420032BIB007","doi-asserted-by":"publisher","DOI":"10.1080\/00207160412331336062"}],"container-title":["Journal of Interconnection Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0219265921420032","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,12,30]],"date-time":"2021-12-30T03:29:47Z","timestamp":1640834987000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0219265921420032"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,6,20]]},"references-count":7,"journal-issue":{"issue":"04","published-print":{"date-parts":[[2021,12]]}},"alternative-id":["10.1142\/S0219265921420032"],"URL":"https:\/\/doi.org\/10.1142\/s0219265921420032","relation":{},"ISSN":["0219-2659","1793-6713"],"issn-type":[{"type":"print","value":"0219-2659"},{"type":"electronic","value":"1793-6713"}],"subject":[],"published":{"date-parts":[[2021,6,20]]},"article-number":"2142003"}}