乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,15]],"date-time":"2024-09-15T16:28:44Z","timestamp":1726417724757},"reference-count":24,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2019,11,1]],"date-time":"2019-11-01T00:00:00Z","timestamp":1572566400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"funder":[{"DOI":"10.13039\/501100001809","name":"NSFC","doi-asserted-by":"publisher","award":["11701143","11701142","11426085"],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"NSFC","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"NSFC","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Applied Mathematics and Computation"],"published-print":{"date-parts":[[2019,11]]},"DOI":"10.1016\/j.amc.2019.05.028","type":"journal-article","created":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T16:12:40Z","timestamp":1559319160000},"page":"169-174","update-policy":"http:\/\/dx.doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["Note on directed proper connection number of a random graph"],"prefix":"10.1016","volume":"361","author":[{"given":"Ran","family":"Gu","sequence":"first","affiliation":[]},{"given":"Bo","family":"Deng","sequence":"additional","affiliation":[]},{"given":"Rui","family":"Li","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.amc.2019.05.028_bib0001","first-page":"189","article-title":"On proper-path colorings in graphs","volume":"97","author":"Andrews","year":"2016","journal-title":"J. Combin. Math. Combin. Comput."},{"year":"2001","series-title":"Random Graphs","author":"Bollob\u00e1s","key":"10.1016\/j.amc.2019.05.028_bib0002"},{"key":"10.1016\/j.amc.2019.05.028_bib0003","doi-asserted-by":"crossref","first-page":"2550","DOI":"10.1016\/j.disc.2011.09.003","article-title":"Proper connection of graphs","volume":"312","author":"Borozan","year":"2012","journal-title":"Discret. Math."},{"key":"10.1016\/j.amc.2019.05.028_bib0004","first-page":"35","article-title":"Random graphs of small order, random graphs","author":"Bollob\u00e1s","year":"1986","journal-title":"Ann. Discret. Math."},{"key":"10.1016\/j.amc.2019.05.028_bib0005","first-page":"49","article-title":"paths through fixed vertices in edge-colored graphs","volume":"127","author":"Chou","year":"1994","journal-title":"Math\u00e9matiques et Sciences Humaines"},{"key":"10.1016\/j.amc.2019.05.028_bib0006","series-title":"Contributions to General Algebra","first-page":"95","article-title":"On permutations of chromosomes","volume":"5","author":"Dorninger","year":"1987"},{"issue":"2","key":"10.1016\/j.amc.2019.05.028_bib0007","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1016\/0166-218X(92)00171-H","article-title":"Hamiltonian circuits determining the order of chromosomes","volume":"50","author":"Dorninger","year":"1994","journal-title":"Discret. Appl. Math."},{"key":"10.1016\/j.amc.2019.05.028_bib0008","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1016\/j.endm.2017.10.041","article-title":"On the (di) graphs with (directed) proper connection number two","volume":"62","author":"Ducoffe","year":"2017","journal-title":"Electron. Notes Discret. Math."},{"key":"10.1016\/j.amc.2019.05.028_bib0009","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1038\/hdy.1987.138","article-title":"Geometrical constraints on Bennett\u2019s predictions of chromosome order","volume":"58","author":"Dorninger","year":"1987","journal-title":"Heredity"},{"key":"10.1016\/j.amc.2019.05.028_bib0010","doi-asserted-by":"crossref","first-page":"290","DOI":"10.5486\/PMD.1959.6.3-4.12","article-title":"On random graphs","volume":"6","author":"Erd\u0151s","year":"1959","journal-title":"Publ. Math. Debrecen"},{"issue":"1","key":"10.1016\/j.amc.2019.05.028_bib0011","first-page":"261","article-title":"On the strength of connectedness of a random graph","volume":"12","author":"Erd\u0151s","year":"1961","journal-title":"Acta Math. Hung."},{"key":"10.1016\/j.amc.2019.05.028_bib0012","doi-asserted-by":"crossref","first-page":"1141","DOI":"10.1214\/aoms\/1177706098","article-title":"Random graphs","volume":"30","author":"Gilbert","year":"1959","journal-title":"Ann. Math. Stat."},{"issue":"2","key":"10.1016\/j.amc.2019.05.028_bib0013","doi-asserted-by":"crossref","first-page":"336","DOI":"10.1016\/j.tcs.2015.10.017","article-title":"Proper connection number of random graphs","volume":"609","author":"Gu","year":"2016","journal-title":"Theor. Comput. Sci."},{"key":"10.1016\/j.amc.2019.05.028_bib0014","doi-asserted-by":"crossref","first-page":"396","DOI":"10.1137\/1118052","article-title":"The strength of connectivity of a random graph","volume":"18","author":"Ivchenko","year":"1973","journal-title":"Theory Probab. Appl."},{"key":"10.1016\/j.amc.2019.05.028_bib0015","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1002\/rsa.3240010106","article-title":"The transitive closure of a random digraph","volume":"1","author":"Karp","year":"1990","journal-title":"Random Struct. Algorithms"},{"issue":"1","key":"10.1016\/j.amc.2019.05.028_bib0016","doi-asserted-by":"crossref","first-page":"86","DOI":"10.1007\/s10878-017-0156-7","article-title":"Rainbow vertex connection of digraphs","volume":"35","author":"Lei","year":"2018","journal-title":"J. Comb. Optim."},{"key":"10.1016\/j.amc.2019.05.028_bib0017","doi-asserted-by":"crossref","first-page":"288","DOI":"10.1016\/j.dam.2017.10.016","article-title":"Total rainbow connection of digraphs","volume":"236","author":"Lei","year":"2018","journal-title":"Discret. Appl. Math."},{"issue":"2","key":"10.1016\/j.amc.2019.05.028_bib0018","doi-asserted-by":"crossref","first-page":"439","DOI":"10.7151\/dmgt.1867","article-title":"Characterizationsof graphs having largeproper connection numbers","volume":"36","author":"Laforge","year":"2016","journal-title":"Discuss. Math. Graph Theory"},{"issue":"1","key":"10.1016\/j.amc.2019.05.028_sbref0019","article-title":"Properly colored notions of connectivity-a dynamic survey","volume":"0","author":"Li","year":"2015","journal-title":"Theory Appl. Graphs"},{"key":"10.1016\/j.amc.2019.05.028_bib0020","series-title":"Springer Briefs in Math.","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-319-89617-5","article-title":"Properly colored connectivity of graphs","author":"Li","year":"2018"},{"key":"10.1016\/j.amc.2019.05.028_bib0021","doi-asserted-by":"crossref","first-page":"40","DOI":"10.2307\/1426466","article-title":"General percolation and random graphs","volume":"13","author":"McDiarmid","year":"1981","journal-title":"Adv. Appl. Probab."},{"issue":"1","key":"10.1016\/j.amc.2019.05.028_bib0022","first-page":"58","article-title":"Directed proper connection of graphs","volume":"68","author":"Magnant","year":"2016","journal-title":"Matematiqki Vesnik"},{"key":"10.1016\/j.amc.2019.05.028_bib0023","first-page":"205","article-title":"On the strong connectedness of directed random graphs","volume":"1","author":"Pal\u00e1sti","year":"1966","journal-title":"Stud. Sci. Math. Hung."},{"key":"10.1016\/j.amc.2019.05.028_bib0024","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1137\/1115004","article-title":"On the probability of connectedness of a random graph Gm(t)","volume":"15","author":"Stepanov","year":"1970","journal-title":"Theory Probab. Appl."}],"container-title":["Applied Mathematics and Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0096300319304217?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0096300319304217?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2023,9,17]],"date-time":"2023-09-17T03:22:42Z","timestamp":1694920962000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0096300319304217"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,11]]},"references-count":24,"alternative-id":["S0096300319304217"],"URL":"https:\/\/doi.org\/10.1016\/j.amc.2019.05.028","relation":{},"ISSN":["0096-3003"],"issn-type":[{"type":"print","value":"0096-3003"}],"subject":[],"published":{"date-parts":[[2019,11]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Note on directed proper connection number of a random graph","name":"articletitle","label":"Article Title"},{"value":"Applied Mathematics and Computation","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.amc.2019.05.028","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2019 Elsevier Inc. All rights reserved.","name":"copyright","label":"Copyright"}]}}