{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,22]],"date-time":"2025-10-22T18:19:37Z","timestamp":1761157177875,"version":"3.41.2"},"reference-count":8,"publisher":"World Scientific Pub Co Pte Ltd","issue":"04","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J. Inter. Net."],"published-print":{"date-parts":[[2021,12]]},"abstract":"<jats:p>In this paper, we consider the concept of the average edge-connectivity [Formula: see text] of a graph [Formula: see text], defined to be the average, over all pairs of vertices, of the maximum number of edge-disjoint paths connecting these vertices. Kim and O previously proved that [Formula: see text] for any connected cubic graph on [Formula: see text] vertices. We refine their result by showing that [Formula: see text] We also characterize the graphs where equality holds.<\/jats:p>","DOI":"10.1142\/s0219265921420020","type":"journal-article","created":{"date-parts":[[2021,6,10]],"date-time":"2021-06-10T04:55:57Z","timestamp":1623300957000},"source":"Crossref","is-referenced-by-count":1,"title":["Average Edge-Connectivity of Cubic Graphs"],"prefix":"10.1142","volume":"21","author":[{"given":"Miaomiao","family":"Zhuo","sequence":"first","affiliation":[{"name":"College of Mathematics and System Sciences, Xinjiang University, Urumqi, Xinjiang 830046, P. R. China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Qinqin","family":"Li","sequence":"additional","affiliation":[{"name":"College of Mathematics and System Sciences, Xinjiang University, Urumqi, Xinjiang 830046, P. R. China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7164-3116","authenticated-orcid":false,"given":"Baoyindureng","family":"Wu","sequence":"additional","affiliation":[{"name":"College of Mathematics and System Sciences, Xinjiang University, Urumqi, Xinjiang 830046, P. R. China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xinhui","family":"An","sequence":"additional","affiliation":[{"name":"College of Mathematics and System Sciences, Xinjiang University, Urumqi, Xinjiang 830046, P. R. China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"219","published-online":{"date-parts":[[2021,6,9]]},"reference":[{"key":"S0219265921420020BIB001","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2013.06.005"},{"key":"S0219265921420020BIB003","doi-asserted-by":"crossref","first-page":"234","DOI":"10.1016\/0095-8956(77)90034-X","volume":"23","author":"Bussemaker F. C.","year":"1977","journal-title":"J. Combin. Theory Ser. B"},{"key":"S0219265921420020BIB004","doi-asserted-by":"publisher","DOI":"10.1016\/S0012-365X(01)00180-7"},{"key":"S0219265921420020BIB005","doi-asserted-by":"publisher","DOI":"10.1016\/S0166-218X(02)00572-3"},{"key":"S0219265921420020BIB006","first-page":"161","volume":"77","author":"Dankelmann P.","year":"2005","journal-title":"Ars Combinatoria"},{"key":"S0219265921420020BIB007","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2003.04.003"},{"key":"S0219265921420020BIB008","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2013.05.024"},{"key":"S0219265921420020BIB009","doi-asserted-by":"crossref","first-page":"116","DOI":"10.1002\/jgt.20443","volume":"64","author":"Suil O.","year":"2010","journal-title":"J. Graph Theory"}],"container-title":["Journal of Interconnection Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0219265921420020","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,11,4]],"date-time":"2023-11-04T18:45:57Z","timestamp":1699123557000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0219265921420020"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,6,9]]},"references-count":8,"journal-issue":{"issue":"04","published-print":{"date-parts":[[2021,12]]}},"alternative-id":["10.1142\/S0219265921420020"],"URL":"https:\/\/doi.org\/10.1142\/s0219265921420020","relation":{},"ISSN":["0219-2659","1793-6713"],"issn-type":[{"type":"print","value":"0219-2659"},{"type":"electronic","value":"1793-6713"}],"subject":[],"published":{"date-parts":[[2021,6,9]]},"article-number":"2142002"}}