{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,27]],"date-time":"2026-04-27T14:16:37Z","timestamp":1777299397026,"version":"3.51.4"},"reference-count":14,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"funder":[{"DOI":"10.13039\/501100003392","name":"Fujian Provincial Natural Science Foundation","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100003392","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","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":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[2026,7]]},"DOI":"10.1016\/j.dam.2026.03.002","type":"journal-article","created":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T21:06:26Z","timestamp":1773349586000},"page":"102-107","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["On maximally edge-connectivity of squares of graphs"],"prefix":"10.1016","volume":"388","author":[{"given":"Mengfan","family":"Chen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2060-9289","authenticated-orcid":false,"given":"Liqiong","family":"Xu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/j.dam.2026.03.002_b1","first-page":"5","article-title":"On the nordhaus-gaddum class problems","volume":"2","author":"Achuthan","year":"1990","journal-title":"Australas. J. Combin."},{"key":"10.1016\/j.dam.2026.03.002_b2","series-title":"Recent Trends in Graph Theory","first-page":"1","article-title":"Connectivity and line connectivity of complementary graphs","author":"Alavi","year":"1970"},{"key":"10.1016\/j.dam.2026.03.002_b3","doi-asserted-by":"crossref","first-page":"250","DOI":"10.1016\/j.dam.2025.01.029","article-title":"On the edge-connectivity of the square of a graph","volume":"366","author":"Balbuena","year":"2025","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/j.dam.2026.03.002_b4","doi-asserted-by":"crossref","first-page":"393","DOI":"10.1002\/jgt.3190030410","article-title":"Graphs with prescribed connectivity and line graph connectivity","volume":"3","author":"Bauer","year":"1979","journal-title":"J. Graph Theory"},{"key":"10.1016\/j.dam.2026.03.002_b5","doi-asserted-by":"crossref","first-page":"778","DOI":"10.1137\/0114065","article-title":"A graph theoretic approach to a communications problem","volume":"14","author":"Chartrand","year":"1966","journal-title":"SIAM J. Appl. Math."},{"key":"10.1016\/j.dam.2026.03.002_b6","doi-asserted-by":"crossref","first-page":"170","DOI":"10.1007\/BF01350320","article-title":"The connectivity of line-graphs","volume":"182","author":"Chartrand","year":"1969","journal-title":"Math. Ann."},{"issue":"1","key":"10.1016\/j.dam.2026.03.002_b7","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1016\/0012-365X(80)90180-6","article-title":"A property of a-fragments of a digraph","volume":"3","author":"Hamidoune","year":"1980","journal-title":"Discrete Math."},{"key":"10.1016\/j.dam.2026.03.002_b8","doi-asserted-by":"crossref","first-page":"7","DOI":"10.1016\/j.ipl.2004.03.013","article-title":"Note on the connectivity of line graphs","volume":"91","author":"Hellwig","year":"2004","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/j.dam.2026.03.002_b9","doi-asserted-by":"crossref","first-page":"3325","DOI":"10.1016\/j.dam.2008.05.012","article-title":"The connectivity of a graph and its complement","volume":"156","author":"Hellwig","year":"2008","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/j.dam.2026.03.002_b10","doi-asserted-by":"crossref","first-page":"3265","DOI":"10.1016\/j.disc.2007.06.035","article-title":"Maximally edge-connected and vertex-connected graphs and digraphs - a survey","volume":"308","author":"Hellwig","year":"2008","journal-title":"Discrete Math."},{"key":"10.1016\/j.dam.2026.03.002_b11","doi-asserted-by":"crossref","first-page":"351","DOI":"10.1016\/0012-365X(74)90154-X","article-title":"Results on the edge-connectivity of graphs","volume":"8","author":"Lesniak","year":"1974","journal-title":"Discrete Math."},{"key":"10.1016\/j.dam.2026.03.002_b12","first-page":"12","article-title":"Superconnectivity and super edge-connectivity of line graphs","volume":"40","author":"Meng","year":"2001","journal-title":"Graph Theory Notes N. Y."},{"key":"10.1016\/j.dam.2026.03.002_b13","first-page":"193","article-title":"Restricted edge-connectivity and minimum edge-degree","volume":"66","author":"Ueffing","year":"2003","journal-title":"Ars Combin."},{"key":"10.1016\/j.dam.2026.03.002_b14","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:S0166218X26001459?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X26001459?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,4,27]],"date-time":"2026-04-27T13:27:29Z","timestamp":1777296449000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X26001459"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,7]]},"references-count":14,"alternative-id":["S0166218X26001459"],"URL":"https:\/\/doi.org\/10.1016\/j.dam.2026.03.002","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[2026,7]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"On maximally edge-connectivity of squares of graphs","name":"articletitle","label":"Article Title"},{"value":"Discrete Applied Mathematics","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.dam.2026.03.002","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 Elsevier B.V. All rights are reserved, including those for text and data mining, AI training, and similar technologies.","name":"copyright","label":"Copyright"}]}}