{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,6]],"date-time":"2026-02-06T14:15:07Z","timestamp":1770387307358,"version":"3.49.0"},"reference-count":24,"publisher":"World Scientific Pub Co Pte Ltd","issue":"02","funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["12101124"],"award-info":[{"award-number":["12101124"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003392","name":"Natural Science Foundation of Fujian Province","doi-asserted-by":"publisher","award":["2022J01934"],"award-info":[{"award-number":["2022J01934"]}],"id":[{"id":"10.13039\/501100003392","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003392","name":"Natural Science Foundation of Fujian Province","doi-asserted-by":"publisher","award":["2022J05199"],"award-info":[{"award-number":["2022J05199"]}],"id":[{"id":"10.13039\/501100003392","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Foundation of Fujian University of Technology","award":["GY-Z20079"],"award-info":[{"award-number":["GY-Z20079"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J. Inter. Net."],"published-print":{"date-parts":[[2026,6]]},"abstract":"<jats:p>A bisection of a graph is a bipartition of its vertex set in which the number of vertices in the two parts differs by at most 1, and its size is the number of edges that go across the two parts. In this paper, motivated by a well-known result of Edwards about Max-Cut, we study maximum bisections of graphs. Let [Formula: see text]. For each [Formula: see text], we show that [Formula: see text] admits a bisection of size larger than Edwards\u2019 bound. We also study the maximum bisection of graphs that seem closely related to the strong product of two paths.<\/jats:p>","DOI":"10.1142\/s0219265925500033","type":"journal-article","created":{"date-parts":[[2025,3,5]],"date-time":"2025-03-05T06:53:46Z","timestamp":1741157626000},"source":"Crossref","is-referenced-by-count":0,"title":["Max-Bisections on Strong Product of Paths and Cycles"],"prefix":"10.1142","volume":"26","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5395-3532","authenticated-orcid":false,"given":"Jing","family":"Lin","sequence":"first","affiliation":[{"name":"School of Computer Science and Mathematics, Fujian University of Technology, Fujian 350118, P. R. China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4277-4376","authenticated-orcid":false,"given":"Lunan","family":"Jia","sequence":"additional","affiliation":[{"name":"School of Computer Science and Mathematics, Fujian University of Technology, Fujian 350118, P. R. China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4047-9891","authenticated-orcid":false,"given":"Ruizhi","family":"Lin","sequence":"additional","affiliation":[{"name":"School of Computer Science and Mathematics, Fujian University of Technology, Fujian 350118, P. R. China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"219","published-online":{"date-parts":[[2025,3,5]]},"reference":[{"key":"S0219265925500033BIB001","doi-asserted-by":"publisher","DOI":"10.1007\/BF01261315"},{"key":"S0219265925500033BIB002","doi-asserted-by":"publisher","DOI":"10.1016\/S0012-365X(97)00041-1"},{"key":"S0219265925500033BIB003","doi-asserted-by":"publisher","DOI":"10.1002\/rsa.10062"},{"key":"S0219265925500033BIB004","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2010.04.004"},{"key":"S0219265925500033BIB005","doi-asserted-by":"publisher","DOI":"10.1016\/j.vlsi.2017.03.006"},{"key":"S0219265925500033BIB006","doi-asserted-by":"publisher","DOI":"10.1007\/s11856-019-1897-z"},{"key":"S0219265925500033BIB007","doi-asserted-by":"publisher","DOI":"10.4153\/CJM-1973-048-x"},{"key":"S0219265925500033BIB008","first-page":"167","volume-title":"Recent Advances in Graph Theory: Proc. 2nd Czechoslovak Sympos. Graph Theory","author":"Edwards C.","year":"1975"},{"key":"S0219265925500033BIB009","doi-asserted-by":"publisher","DOI":"10.1016\/S0012-365X(97)00004-6"},{"key":"S0219265925500033BIB010","doi-asserted-by":"publisher","DOI":"10.1017\/S0963548317000487"},{"key":"S0219265925500033BIB011","unstructured":"S. Glock, O. Janzer and B. Sudakov, New results for MaxCut in H-free graphs, arXiv:2104.06971."},{"key":"S0219265925500033BIB012","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2019.07.006"},{"key":"S0219265925500033BIB013","doi-asserted-by":"publisher","DOI":"10.1002\/jgt.22717"},{"key":"S0219265925500033BIB014","doi-asserted-by":"publisher","DOI":"10.1016\/j.jctb.2019.03.001"},{"key":"S0219265925500033BIB015","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2018.12.022"},{"key":"S0219265925500033BIB016","doi-asserted-by":"publisher","DOI":"10.1016\/j.jctb.2013.06.002"},{"key":"S0219265925500033BIB017","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcta.2021.105404"},{"key":"S0219265925500033BIB018","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2021.12.031"},{"key":"S0219265925500033BIB019","doi-asserted-by":"publisher","DOI":"10.1007\/s11704-016-6109-y"},{"key":"S0219265925500033BIB020","doi-asserted-by":"publisher","DOI":"10.1016\/j.jctb.2010.06.002"},{"key":"S0219265925500033BIB021","doi-asserted-by":"publisher","DOI":"10.1137\/S0895480191196824"},{"key":"S0219265925500033BIB022","series-title":"London Math. Soc. Lecture Note Ser.","first-page":"95","volume-title":"Surveys in Combinatorics","volume":"327","author":"Scott A.","year":"2005"},{"key":"S0219265925500033BIB023","doi-asserted-by":"publisher","DOI":"10.1016\/j.jctb.2014.01.004"},{"key":"S0219265925500033BIB024","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2010.03.029"}],"container-title":["Journal of Interconnection Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0219265925500033","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,2,6]],"date-time":"2026-02-06T01:40:11Z","timestamp":1770342011000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/10.1142\/S0219265925500033"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,3,5]]},"references-count":24,"journal-issue":{"issue":"02","published-print":{"date-parts":[[2026,6]]}},"alternative-id":["10.1142\/S0219265925500033"],"URL":"https:\/\/doi.org\/10.1142\/s0219265925500033","relation":{},"ISSN":["0219-2659","1793-6713"],"issn-type":[{"value":"0219-2659","type":"print"},{"value":"1793-6713","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,3,5]]},"article-number":"2550003"}}