乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,4]],"date-time":"2024-07-04T00:20:40Z","timestamp":1720052440290},"reference-count":16,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"funder":[{"DOI":"10.13039\/501100000038","name":"NSERC","doi-asserted-by":"publisher","award":["RGPIN-2016-05237"],"id":[{"id":"10.13039\/501100000038","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[2021,1]]},"DOI":"10.1016\/j.dam.2020.10.015","type":"journal-article","created":{"date-parts":[[2020,11,1]],"date-time":"2020-11-01T18:31:56Z","timestamp":1604255516000},"page":"233-247","update-policy":"http:\/\/dx.doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":3,"special_numbering":"C","title":["Average connectivity of minimally 2-connected graphs and average edge-connectivity of minimally 2-edge-connected graphs"],"prefix":"10.1016","volume":"289","author":[{"given":"Roc\u00edo M.","family":"Casablanca","sequence":"first","affiliation":[]},{"given":"Lucas","family":"Mol","sequence":"additional","affiliation":[]},{"given":"Ortrud R.","family":"Oellermann","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"18","key":"10.1016\/j.dam.2020.10.015_b1","doi-asserted-by":"crossref","first-page":"2795","DOI":"10.1016\/j.dam.2013.06.005","article-title":"On average connectivity of the strong product of graphs","volume":"161","author":"Abajo","year":"2013","journal-title":"Discrete Appl. Math."},{"issue":"1\u20133","key":"10.1016\/j.dam.2020.10.015_b2","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1016\/S0012-365X(01)00180-7","article-title":"The average connectivity of a graph","volume":"252","author":"Beineke","year":"2002","journal-title":"Discrete Math."},{"key":"10.1016\/j.dam.2020.10.015_b3","doi-asserted-by":"crossref","first-page":"126","DOI":"10.1016\/j.compenvurbsys.2017.05.004","article-title":"OSMnx: New methods for acquiring, constructing, analyzing, and visualizing complex street networks","volume":"65","author":"Boeing","year":"2017","journal-title":"Comput. Environ. Urban Syst."},{"key":"10.1016\/j.dam.2020.10.015_b4","series-title":"Extremal Graph Theory","author":"Bollob\u00e1s","year":"2004"},{"issue":"1","key":"10.1016\/j.dam.2020.10.015_b5","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1002\/jgt.3190030103","article-title":"Minimally 2-edge connected graphs","volume":"3","author":"Chaty","year":"1979","journal-title":"J. Graph Theory"},{"issue":"2\u20133","key":"10.1016\/j.dam.2020.10.015_b6","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1016\/S0166-218X(02)00572-3","article-title":"Bounds on the average connectivity of a graph","volume":"129","author":"Dankelmann","year":"2003","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/j.dam.2020.10.015_b7","first-page":"161","article-title":"Degree sequences of optimally edge-connected multigraphs","volume":"77","author":"Dankelmann","year":"2005","journal-title":"Ars Combin."},{"key":"10.1016\/j.dam.2020.10.015_b8","first-page":"204","article-title":"Minimally 2-connected graphs","volume":"228","author":"Dirac","year":"1967","journal-title":"J. Reine Angew. Math."},{"issue":"3","key":"10.1016\/j.dam.2020.10.015_b9","doi-asserted-by":"crossref","first-page":"496","DOI":"10.1137\/0110037","article-title":"On realizability of a set of integers as degrees of the vertices of a linear graph","volume":"10","author":"Hakimi","year":"1962","journal-title":"J. Soc. Ind. Appl. Math."},{"issue":"20","key":"10.1016\/j.dam.2020.10.015_b10","doi-asserted-by":"crossref","first-page":"2232","DOI":"10.1016\/j.disc.2013.05.024","article-title":"Average connectivity and average edge-connectivity in graphs","volume":"313","author":"Kim","year":"2013","journal-title":"Discrete Math."},{"key":"10.1016\/j.dam.2020.10.015_b11","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1007\/BF01304873","article-title":"Ecken vom grad n in minimalen n-fach zusammenhangenden graphen\u0308","volume":"23","author":"Mader","year":"1972","journal-title":"Arch. Math."},{"key":"10.1016\/j.dam.2020.10.015_b12","doi-asserted-by":"crossref","first-page":"96","DOI":"10.4064\/fm-10-1-96-115","article-title":"Zur allgemeinen Kurventheorie","volume":"10","author":"Menger","year":"1927","journal-title":"Fund. Math."},{"key":"10.1016\/j.dam.2020.10.015_b13","series-title":"Topics in Structural Graph Theory","article-title":"Menger\u2019s theorem","author":"Oellermann","year":"2013"},{"issue":"1","key":"10.1016\/j.dam.2020.10.015_b14","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1090\/S0002-9947-1968-0228369-8","article-title":"On minimal blocks","volume":"134","author":"Plummer","year":"1968","journal-title":"Trans. Amer. Math. Soc."},{"issue":"4","key":"10.1016\/j.dam.2020.10.015_b15","doi-asserted-by":"crossref","first-page":"423","DOI":"10.1007\/s11235-015-9987-7","article-title":"Future research directions in design of reliable communication systems","volume":"60","author":"Rak","year":"2015","journal-title":"Telecommun. Syst."},{"issue":"1","key":"10.1016\/j.dam.2020.10.015_b16","doi-asserted-by":"crossref","first-page":"150","DOI":"10.2307\/2371086","article-title":"Congruent graphs and the connectivity of graphs","volume":"54","author":"Whitney","year":"1932","journal-title":"Amer. J. Math."}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X20304674?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X20304674?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,12,7]],"date-time":"2020-12-07T21:40:25Z","timestamp":1607377225000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X20304674"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,1]]},"references-count":16,"alternative-id":["S0166218X20304674"],"URL":"https:\/\/doi.org\/10.1016\/j.dam.2020.10.015","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[2021,1]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Average connectivity of minimally 2-connected graphs and average edge-connectivity of minimally 2-edge-connected graphs","name":"articletitle","label":"Article Title"},{"value":"Discrete Applied Mathematics","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.dam.2020.10.015","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2020 Elsevier B.V. All rights reserved.","name":"copyright","label":"Copyright"}]}}