{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,17]],"date-time":"2025-10-17T14:09:40Z","timestamp":1760710180341,"version":"3.37.3"},"reference-count":34,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2020]]},"DOI":"10.1109\/access.2020.2983130","type":"journal-article","created":{"date-parts":[[2020,3,24]],"date-time":"2020-03-24T22:31:36Z","timestamp":1585089096000},"page":"59126-59134","source":"Crossref","is-referenced-by-count":7,"title":["On the Edge-Connectivity of an Uncertain Random Graph"],"prefix":"10.1109","volume":"8","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-9743-6983","authenticated-orcid":false,"given":"Hao","family":"Li","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3604-756X","authenticated-orcid":false,"given":"Hui","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.4304\/jnw.9.9.2353-2359"},{"key":"ref32","first-page":"22","article-title":"Matching index and its algorithm of uncertain random graph","volume":"17","author":"zhang","year":"2018","journal-title":"Comput Math Appl"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1080\/00207160.2015.1100720"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1080\/00207160.2012.727404"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1007\/s10700-014-9183-3"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TFUZZ.2015.2500267"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2014.10.048"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1214\/aoms\/1177706098"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.18280\/mmep.010104"},{"key":"ref14","doi-asserted-by":"crossref","first-page":"1739","DOI":"10.1007\/s00500-014-1361-2","article-title":"Uncertain random multilevel programming with application to production control problem","volume":"19","author":"ke","year":"2015","journal-title":"Soft Comput"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-49888-6"},{"key":"ref16","first-page":"89","article-title":"On the matching number of an uncertain graph","volume":"15","author":"li","year":"2018","journal-title":"Iranian J Fuzzy Syst"},{"journal-title":"Uncertainty Theory","year":"2007","author":"liu","key":"ref17"},{"key":"ref18","first-page":"3","article-title":"Uncertain random graph and uncertain random network","volume":"8","author":"liu","year":"2014","journal-title":"J Uncertain Syst"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1007\/s10700-012-9149-2"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1016\/j.amc.2012.04.005"},{"key":"ref4","doi-asserted-by":"crossref","first-page":"290","DOI":"10.5486\/PMD.1959.6.3-4.12","article-title":"On random graphs","volume":"6","author":"erdos","year":"1959","journal-title":"Publicationes Mathematicae"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/TFUZZ.2015.2466080"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.3233\/JIFS-17373"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.3233\/IFS-141133"},{"key":"ref29","first-page":"381","article-title":"Matching index of an uncertain graph: Concept and algorithm","volume":"12","author":"zhang","year":"2013","journal-title":"Comput Math Appl"},{"key":"ref5","first-page":"270","article-title":"Cycle Index of uncertain graph","volume":"15","author":"gao","year":"2013","journal-title":"Information"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1142\/S0218488513500074"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1007\/s00500-015-1597-5"},{"key":"ref2","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-84628-970-5","author":"bondy","year":"2008","journal-title":"Graph Theory"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1007\/s10586-017-1471-6"},{"journal-title":"Random Graphs","year":"2011","author":"bollob\u00e1s","key":"ref1"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1007\/s00500-012-0935-0"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1007\/s10700-017-9277-9"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1142\/S021848851450024X"},{"key":"ref24","first-page":"24","article-title":"Uncertain programming models for assignment problem with restriction of qualification","volume":"13","author":"rosyida","year":"2019","journal-title":"J Uncertain Syst"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1007\/s10700-016-9260-x"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1007\/s10700-016-9235-y"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-387-74642-5"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6287639\/8948470\/09045935.pdf?arnumber=9045935","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,29]],"date-time":"2023-09-29T02:19:33Z","timestamp":1695953973000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9045935\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"references-count":34,"URL":"https:\/\/doi.org\/10.1109\/access.2020.2983130","relation":{},"ISSN":["2169-3536"],"issn-type":[{"type":"electronic","value":"2169-3536"}],"subject":[],"published":{"date-parts":[[2020]]}}}