{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T06:24:56Z","timestamp":1740119096553,"version":"3.37.3"},"reference-count":33,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2018,6,1]],"date-time":"2018-06-01T00:00:00Z","timestamp":1527811200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2019,3,14]],"date-time":"2019-03-14T00:00:00Z","timestamp":1552521600000},"content-version":"am","delay-in-days":286,"URL":"http:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"},{"start":{"date-parts":[[2018,6,1]],"date-time":"2018-06-01T00:00:00Z","timestamp":1527811200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2018,6,1]],"date-time":"2018-06-01T00:00:00Z","timestamp":1527811200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2018,6,1]],"date-time":"2018-06-01T00:00:00Z","timestamp":1527811200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2018,6,1]],"date-time":"2018-06-01T00:00:00Z","timestamp":1527811200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2018,6,1]],"date-time":"2018-06-01T00:00:00Z","timestamp":1527811200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Science Foundation of China","doi-asserted-by":"publisher","award":["11661066"],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Science Foundation of China","doi-asserted-by":"publisher","award":["11371021"],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Future Generation Computer Systems"],"published-print":{"date-parts":[[2018,6]]},"DOI":"10.1016\/j.future.2017.01.023","type":"journal-article","created":{"date-parts":[[2017,1,25]],"date-time":"2017-01-25T17:18:33Z","timestamp":1485364713000},"page":"450-453","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":8,"special_numbering":"C","title":["Spectrum bounds for the scattering number, integrity, tenacity of regular graphs"],"prefix":"10.1016","volume":"83","author":[{"given":"Yinkui","family":"Li","sequence":"first","affiliation":[]},{"given":"Yongtang","family":"Shi","sequence":"additional","affiliation":[]},{"given":"Xiaofeng","family":"Gu","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"year":"1976","series-title":"Graph Theory with Applications","author":"Bondy","key":"10.1016\/j.future.2017.01.023_br000005"},{"key":"10.1016\/j.future.2017.01.023_br000010","doi-asserted-by":"crossref","first-page":"458","DOI":"10.1016\/j.laa.2009.08.029","article-title":"Eigenvalues and edge-connectivity of regular graphs","volume":"432","author":"Cioab\u0103","year":"2010","journal-title":"Linear Algebra Appl."},{"key":"10.1016\/j.future.2017.01.023_br000015","doi-asserted-by":"crossref","first-page":"630","DOI":"10.1016\/j.laa.2012.03.013","article-title":"Edge-disjoint spanning trees and eigenvalues of regular graphs","volume":"437","author":"Cioab\u0103","year":"2012","journal-title":"Linear Algebra Appl."},{"key":"10.1016\/j.future.2017.01.023_br000020","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1016\/j.dam.2013.12.004","article-title":"The spectrum and toughness of regular graphs","volume":"176","author":"Cioab\u0103","year":"2014","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/j.future.2017.01.023_br000025","doi-asserted-by":"crossref","first-page":"82","DOI":"10.1016\/j.laa.2015.11.038","article-title":"Spectral conditions for edge connectivity and packing spanning trees in multigraphs","volume":"493","author":"Gu","year":"2016","journal-title":"Linear Algebra Appl."},{"key":"10.1016\/j.future.2017.01.023_br000030","doi-asserted-by":"crossref","first-page":"16","DOI":"10.1002\/jgt.21857","article-title":"Edge-disjoint spanning trees, edge connectivity and eigenvalues in graphs","volume":"81","author":"Gu","year":"2016","journal-title":"J. Graph Theory"},{"key":"10.1016\/j.future.2017.01.023_br000035","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1016\/j.dam.2016.04.027","article-title":"Fractional spanning tree packing, forest covering and eigenvalues","volume":"213","author":"Hong","year":"2016","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/j.future.2017.01.023_br000040","doi-asserted-by":"crossref","first-page":"2784","DOI":"10.1016\/j.laa.2013.08.041","article-title":"Edge-disjoint spanning trees and eigenvalues of graphs","volume":"439","author":"Li","year":"2013","journal-title":"Linear Algebra Appl."},{"key":"10.1016\/j.future.2017.01.023_br000045","doi-asserted-by":"crossref","first-page":"146","DOI":"10.1016\/j.laa.2013.11.039","article-title":"Edge-disjoint spanning trees and eigenvalues","volume":"444","author":"Liu","year":"2014","journal-title":"Linear Algebra Appl."},{"key":"10.1016\/j.future.2017.01.023_br000050","doi-asserted-by":"crossref","first-page":"128","DOI":"10.1016\/j.laa.2014.05.044","article-title":"Note on edge-disjoint spanning trees and eigenvalues","volume":"458","author":"Liu","year":"2014","journal-title":"Linear Algebra Appl."},{"key":"10.1016\/j.future.2017.01.023_br000055","doi-asserted-by":"crossref","first-page":"298","DOI":"10.21136\/CMJ.1973.101168","article-title":"Algebraic connectivity of graphs","volume":"23","author":"Fiedler","year":"1973","journal-title":"Czechoslovak Math. J."},{"key":"10.1016\/j.future.2017.01.023_br000060","series-title":"Pseudo-Random Graphs. More Sets, Graphs and Numbers","first-page":"199","volume":"vol. 15","author":"Krivelevich","year":"2006"},{"key":"10.1016\/j.future.2017.01.023_br000065","doi-asserted-by":"crossref","first-page":"913","DOI":"10.1007\/s10587-016-0300-z","article-title":"Connectivity, toughness, spanning trees of bounded degree, and the spectrum of regular graphs","volume":"66","author":"Cioab\u0103","year":"2016","journal-title":"Czechoslovak Math. J."},{"key":"10.1016\/j.future.2017.01.023_br000070","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1023\/A:1022453926717","article-title":"Tough Ramsey graphs without short cycles","volume":"4","author":"Alon","year":"1995","journal-title":"J. Algebraic Combin."},{"key":"10.1016\/j.future.2017.01.023_br000075","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1016\/0024-3795(95)00154-J","article-title":"Toughness and spectrum of a graphs","volume":"226\/228","author":"Brouwer","year":"1995","journal-title":"Linear Algebra Appl."},{"key":"10.1016\/j.future.2017.01.023_br000080","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1016\/j.laa.2004.08.014","article-title":"Eigenvalues and perfect matchings","volume":"395","author":"Brouwer","year":"2005","journal-title":"Linear Algebra Appl."},{"key":"10.1016\/j.future.2017.01.023_br000085","doi-asserted-by":"crossref","first-page":"1470","DOI":"10.1137\/100786824","article-title":"Edge-connectivity, eigenvalues and matchings in regular graphs","volume":"24","author":"Cioab\u0103","year":"2010","journal-title":"SIAM J. Discrete Math."},{"key":"10.1016\/j.future.2017.01.023_br000090","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1016\/j.jctb.2008.06.008","article-title":"Matchings in regular graphs from eigenvalues","volume":"99","author":"Cioab\u0103","year":"2009","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/j.future.2017.01.023_br000095","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1016\/j.ejc.2014.05.007","article-title":"Regular factors and eigenvalues of regular graphs","volume":"42","author":"Gu","year":"2014","journal-title":"European J. Combin."},{"key":"10.1016\/j.future.2017.01.023_br000100","doi-asserted-by":"crossref","first-page":"349","DOI":"10.1002\/jgt.20581","article-title":"Regular graphs, eigenvalues and regular factors","volume":"69","author":"Lu","year":"2012","journal-title":"J. Graph Theory"},{"key":"10.1016\/j.future.2017.01.023_br000105","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1016\/S0012-365X(97)00166-0","article-title":"Regular factors of simple regular graphs and factor-spectra","volume":"185","author":"Niessen","year":"1998","journal-title":"Discrete Math."},{"key":"10.1016\/j.future.2017.01.023_br000110","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1016\/0095-8956(78)90013-8","article-title":"On a class of posets and the corresponding comparability graphs","volume":"24","author":"Jung","year":"1978","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/j.future.2017.01.023_br000115","doi-asserted-by":"crossref","first-page":"910","DOI":"10.1016\/j.disc.2006.03.011","article-title":"Tough graphs and Hamiltonian circuits","volume":"306","author":"Chv\u00e1tal","year":"2006","journal-title":"Discrete Math."},{"key":"10.1016\/j.future.2017.01.023_br000120","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1016\/0012-365X(82)90145-5","article-title":"A catalogue of small maximal non-Hamiltonian graphs","volume":"39","author":"Jamrozik","year":"1982","journal-title":"Discrete Math."},{"key":"10.1016\/j.future.2017.01.023_br000125","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1016\/0012-365X(88)90069-6","article-title":"Scattering number and extremal non-Hamiltonian graphs","volume":"71","author":"Hendry","year":"1988","journal-title":"Discrete Math."},{"issue":"2","key":"10.1016\/j.future.2017.01.023_br000130","doi-asserted-by":"crossref","first-page":"102","DOI":"10.1002\/1097-0037(200103)37:2<102::AID-NET5>3.0.CO;2-S","article-title":"Scattering number in graphs","volume":"37","author":"Zhang","year":"2001","journal-title":"Networks"},{"key":"10.1016\/j.future.2017.01.023_br000135","first-page":"12","article-title":"Vulnerability in graphs\u2014A comparative survey","volume":"1","author":"Barefoot","year":"1987","journal-title":"J. Combin. Math. Combin. Comput."},{"key":"10.1016\/j.future.2017.01.023_br000140","first-page":"27","article-title":"Integrity of regular graphs and integrity graphs","volume":"37","author":"Atici","year":"2001","journal-title":"J. Combin. Math. Combin. Comput."},{"key":"10.1016\/j.future.2017.01.023_br000145","first-page":"139","article-title":"Integrity in graphs: bounds and basics","volume":"7","author":"Goddard","year":"1990","journal-title":"J. Combin. Math. Combin. Comput."},{"key":"10.1016\/j.future.2017.01.023_br000150","first-page":"179","article-title":"Computational complexity of integrity","volume":"2","author":"Clark","year":"1987","journal-title":"J. Combin. Math. Combin. Comput."},{"key":"10.1016\/j.future.2017.01.023_br000155","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1016\/j.dam.2003.07.002","article-title":"The integrity of a cubic graph","volume":"140","author":"Vince","year":"2004","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/j.future.2017.01.023_br000160","series-title":"Proc Seventh International Conf on the Theory and Applications of Graphs","first-page":"1111","article-title":"The tenacity of a graph","author":"Cozzens","year":"1995"},{"year":"1997","series-title":"Spectral Graph Theory","author":"Chung","key":"10.1016\/j.future.2017.01.023_br000165"}],"container-title":["Future Generation Computer Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167739X17301292?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167739X17301292?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2024,4,6]],"date-time":"2024-04-06T01:27:07Z","timestamp":1712366827000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0167739X17301292"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,6]]},"references-count":33,"alternative-id":["S0167739X17301292"],"URL":"https:\/\/doi.org\/10.1016\/j.future.2017.01.023","relation":{},"ISSN":["0167-739X"],"issn-type":[{"type":"print","value":"0167-739X"}],"subject":[],"published":{"date-parts":[[2018,6]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Spectrum bounds for the scattering number, integrity, tenacity of regular graphs","name":"articletitle","label":"Article Title"},{"value":"Future Generation Computer Systems","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.future.2017.01.023","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2017 Elsevier B.V. All rights reserved.","name":"copyright","label":"Copyright"}]}}