{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T13:28:07Z","timestamp":1740144487453,"version":"3.37.3"},"reference-count":28,"publisher":"EDP Sciences","issue":"4","license":[{"start":{"date-parts":[[2024,8,15]],"date-time":"2024-08-15T00:00:00Z","timestamp":1723680000000},"content-version":"vor","delay-in-days":45,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100002858","name":"China Postdoctoral Science Foundation","doi-asserted-by":"publisher","award":["2023M731585"],"award-info":[{"award-number":["2023M731585"]}],"id":[{"id":"10.13039\/501100002858","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["12301441"],"award-info":[{"award-number":["12301441"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["12201304"],"award-info":[{"award-number":["12201304"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["RAIRO-Oper. Res."],"accepted":{"date-parts":[[2024,6,23]]},"published-print":{"date-parts":[[2024,7]]},"abstract":"<jats:p>Many physical structures can conveniently be simulated by networks. To study the properties of the network, we use a graph to simulate the network. A graph <jats:italic>H<\/jats:italic> is called an <jats:italic>F<\/jats:italic>-factor of a graph <jats:italic>G<\/jats:italic>, if <jats:italic>H<\/jats:italic> is a spanning subgraph of <jats:italic>G<\/jats:italic> and every connected component of <jats:italic>H<\/jats:italic> is isomorphic to a graph from the graph set <jats:italic>F<\/jats:italic>. An <jats:italic>F<\/jats:italic>-factor is also referred as a component factor. The graph-based network parameter <jats:italic>degree sum<\/jats:italic> of <jats:italic>G<\/jats:italic> is defined by<\/jats:p>\n<jats:p>\n$ \\sigma_k{(G)}=\\underset{X\\subseteq V(G)}\\min\\,{\\{\\underset{x\\in X}{\\mathrm\\Sigma}\\,d_G{(x)}:X\\text{is an independent set of}k\\text{vertices}\\}.}$\n<\/jats:p>\n<jats:p>In this article, we give the precise degree sum condition for a graph to have {<jats:italic>P<\/jats:italic><jats:sub>2<\/jats:sub>, <jats:italic>C<\/jats:italic><jats:sub>3<\/jats:sub>, <jats:italic>P<\/jats:italic><jats:sub>5<\/jats:sub>, <jats:italic>T<\/jats:italic> (3)}-factor and {<jats:italic>K<\/jats:italic><jats:sub>1,1<\/jats:sub>, <jats:italic>K<\/jats:italic><jats:sub>1,2<\/jats:sub>, \u2026, <jats:italic>K<\/jats:italic><jats:sub>1,<jats:italic>k<\/jats:italic><\/jats:sub>, <jats:italic>T<\/jats:italic> (2<jats:italic>k<\/jats:italic> + 1)}-factor. We also obtain similar results for {<jats:italic>P<\/jats:italic><jats:sub>2<\/jats:sub>, <jats:italic>C<\/jats:italic><jats:sub>3<\/jats:sub>, <jats:italic>P<\/jats:italic><jats:sub>5<\/jats:sub>, <jats:italic>T<\/jats:italic> (3)}-factor avoidable graph and {<jats:italic>K<\/jats:italic><jats:sub>1,1<\/jats:sub>, <jats:italic>K<\/jats:italic><jats:sub>1,2<\/jats:sub>, \u2026, <jats:italic>K<\/jats:italic><jats:sub>1,k<\/jats:sub>, <jats:italic>T<\/jats:italic> (2<jats:italic>k<\/jats:italic> + 1)}-factor avoidable graph, respectively.<\/jats:p>","DOI":"10.1051\/ro\/2024132","type":"journal-article","created":{"date-parts":[[2024,6,25]],"date-time":"2024-06-25T08:09:27Z","timestamp":1719302967000},"page":"3337-3346","source":"Crossref","is-referenced-by-count":0,"title":["On graph-based network parameters and component factors in networks"],"prefix":"10.1051","volume":"58","author":[{"given":"Ting","family":"Jin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tongtong","family":"Hu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5839-4573","authenticated-orcid":false,"given":"Guowei","family":"Dai","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kunqi","family":"Su","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shijun","family":"Xiao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"250","published-online":{"date-parts":[[2024,8,15]]},"reference":[{"key":"R1","doi-asserted-by":"crossref","unstructured":"Akiyama J. and Kano M., Factors and Factorizations of Graphs. Springer, Berlin, Lecture Notes in Mathematics, 2031 (2011) 1\u2013347.","DOI":"10.1007\/978-3-642-21919-1_1"},{"key":"R2","first-page":"97","volume":"16","author":"Akiyama","year":"1980","journal-title":"TRU Math."},{"key":"R3","doi-asserted-by":"crossref","first-page":"1C6","DOI":"10.1016\/0012-365X(82)90048-6","volume":"42","author":"Amahashi","year":"1982","journal-title":"Discrete Math."},{"key":"R4","doi-asserted-by":"crossref","unstructured":"Bondy J.A. and Murty U.S.R., Graph Theory. Springer (2008).","DOI":"10.1007\/978-1-84628-970-5"},{"key":"R5","doi-asserted-by":"crossref","first-page":"5","DOI":"10.7151\/dmgt.2353","volume":"43","author":"Dai","year":"2023","journal-title":"Discuss. Math. Graph Theory"},{"key":"R6","first-page":"105","volume":"24","author":"Dai","year":"2023","journal-title":"Proc. Rom. Acad. Ser. A"},{"key":"R7","doi-asserted-by":"crossref","unstructured":"Dai G., Degree sum conditions for path-factor uniform graphs. Indian J. Pure Appl. Math. (2023) 1\u20137.","DOI":"10.1007\/s13226-023-00446-7"},{"key":"R8","doi-asserted-by":"crossref","first-page":"1913","DOI":"10.1007\/s00373-020-02184-7","volume":"36","author":"Dai","year":"2020","journal-title":"Graphs Combin."},{"key":"R9","doi-asserted-by":"crossref","first-page":"2907","DOI":"10.1051\/ro\/2021140","volume":"55","author":"Dai","year":"2021","journal-title":"RAIRO:RO"},{"key":"R10","doi-asserted-by":"crossref","first-page":"2895","DOI":"10.1051\/ro\/2022112","volume":"56","author":"Dai","year":"2022","journal-title":"RAIRO:RO"},{"key":"R11","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1112\/plms\/s3-2.1.69","volume":"2","author":"Dirac","year":"1952","journal-title":"Proc. London Math. Soc."},{"key":"R12","doi-asserted-by":"crossref","unstructured":"Gao W. and Wang W., Remarks on component factors. J. Oper. Res. Soc. China (2021).","DOI":"10.1007\/s40305-021-00357-6"},{"key":"R13","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1016\/S0095-8956(03)00027-3","volume":"88","author":"Kaneko","year":"2003","journal-title":"J. Combin. Theory Ser. B."},{"key":"R14","doi-asserted-by":"crossref","first-page":"2005C2008","DOI":"10.1016\/j.disc.2012.03.017","volume":"312","author":"Kano","year":"2012","journal-title":"Discrete Math."},{"key":"R15","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1016\/j.disc.2004.01.016","volume":"283","author":"Kano","year":"2004","journal-title":"Discrete Math."},{"key":"R16","doi-asserted-by":"crossref","first-page":"551","DOI":"10.7151\/dmgt.1426","volume":"28","author":"Kano","year":"2008","journal-title":"Discuss. Math. Graph Theory"},{"key":"R17","doi-asserted-by":"crossref","first-page":"385C389","DOI":"10.1016\/j.aml.2009.11.003","volume":"23","author":"Kano","year":"2010","journal-title":"Appl. Math. Lett."},{"key":"R18","doi-asserted-by":"crossref","unstructured":"Kano M., Lu H. and Yu Q., Fractional factors, component factors and isolated vertex conditions in graphs. Electron. J. Comb., 26 (2019).","DOI":"10.37236\/8498"},{"key":"R19","doi-asserted-by":"crossref","first-page":"559","DOI":"10.1007\/s00373-020-02266-6","volume":"37","author":"Klopp","year":"2021","journal-title":"Graphs Comb."},{"key":"R20","first-page":"25","volume":"23","author":"Liu","year":"2022","journal-title":"P. Romanian Acad. A"},{"key":"R21","doi-asserted-by":"crossref","first-page":"55","DOI":"10.2307\/2308928","volume":"67","author":"Ore","year":"1960","journal-title":"Am. Math. Mon."},{"key":"R22","doi-asserted-by":"crossref","first-page":"314","DOI":"10.4153\/CJM-1952-028-2","volume":"4","author":"Tutte","year":"1952","journal-title":"Canad. J. Math."},{"key":"R23","doi-asserted-by":"crossref","first-page":"922","DOI":"10.1090\/S0002-9939-1953-0063009-7","volume":"4","author":"Tutte","year":"1953","journal-title":"Proc. Am. Math. Soc."},{"key":"R24","doi-asserted-by":"crossref","unstructured":"Yu Q. and Liu G., Graph Factors and Matching Extensions. Higher Education Press, Beijing (2009).","DOI":"10.1007\/978-3-540-93952-8"},{"key":"R25","doi-asserted-by":"crossref","first-page":"2067","DOI":"10.1016\/j.disc.2008.04.022","volume":"309","author":"Zhang","year":"2009","journal-title":"Discrete Math."},{"key":"R26","doi-asserted-by":"crossref","first-page":"723","DOI":"10.1051\/ro\/2017045","volume":"53","author":"Zhou","year":"2019","journal-title":"RAIRO:RO"},{"key":"R27","doi-asserted-by":"crossref","first-page":"1055","DOI":"10.7151\/dmgt.1974","volume":"37","author":"Zhou","year":"2017","journal-title":"Discuss. Math. Graph Theory"},{"key":"R28","first-page":"167","volume":"14","author":"Zhou","year":"2019","journal-title":"Contrib. Discrete Math."}],"container-title":["RAIRO - Operations Research"],"original-title":[],"link":[{"URL":"https:\/\/www.rairo-ro.org\/10.1051\/ro\/2024132\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,8,20]],"date-time":"2024-08-20T07:55:21Z","timestamp":1724140521000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.rairo-ro.org\/10.1051\/ro\/2024132"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,7]]},"references-count":28,"journal-issue":{"issue":"4"},"alternative-id":["ro240104"],"URL":"https:\/\/doi.org\/10.1051\/ro\/2024132","relation":{},"ISSN":["0399-0559","2804-7303"],"issn-type":[{"type":"print","value":"0399-0559"},{"type":"electronic","value":"2804-7303"}],"subject":[],"published":{"date-parts":[[2024,7]]}}}