{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,15]],"date-time":"2026-01-15T22:42:53Z","timestamp":1768516973589,"version":"3.49.0"},"reference-count":25,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2025,1,20]],"date-time":"2025-01-20T00:00:00Z","timestamp":1737331200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,20]],"date-time":"2025-01-20T00:00:00Z","timestamp":1737331200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100007129","name":"Natural Science Foundation of Shandong Province","doi-asserted-by":"publisher","award":["ZR2022MA077"],"award-info":[{"award-number":["ZR2022MA077"]}],"id":[{"id":"10.13039\/501100007129","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["12171239"],"award-info":[{"award-number":["12171239"]}],"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":["ZR2022MA077"],"award-info":[{"award-number":["ZR2022MA077"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2025,3]]},"DOI":"10.1007\/s10878-024-01256-1","type":"journal-article","created":{"date-parts":[[2025,1,20]],"date-time":"2025-01-20T18:53:25Z","timestamp":1737399205000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["$$(K_{1}\\vee {P_{t})}$$-saturated graphs with minimum number of edges"],"prefix":"10.1007","volume":"49","author":[{"given":"Jinze","family":"Hu","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5345-9953","authenticated-orcid":false,"given":"Shengjin","family":"Ji","sequence":"additional","affiliation":[]},{"given":"Qing","family":"Cui","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,1,20]]},"reference":[{"key":"1256_CR1","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-349-03521-2","volume-title":"Graph theory with applications","author":"JA Bondy","year":"1976","unstructured":"Bondy JA, Murty USR (1976) Graph theory with applications. Elsevier, New York"},{"key":"1256_CR2","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2022.112867","volume":"345","author":"A Cameron","year":"2020","unstructured":"Cameron A, Puleo GJ (2020) A lower bound on the saturation number and graphs for which it is sharp. Discrete Math 345:112867","journal-title":"Discrete Math"},{"key":"1256_CR3","doi-asserted-by":"publisher","first-page":"108","DOI":"10.1016\/j.dam.2022.10.001","volume":"325","author":"S Cao","year":"2023","unstructured":"Cao S, Lei H, Lian X, Yao S, Zhang J (2023) Saturation numbers for $$tP_k$$ with $$k$$ less than $$6$$. Discrete Appl Math 325:108\u2013119","journal-title":"Discrete Appl Math"},{"key":"1256_CR4","first-page":"29","volume":"75","author":"G Chen","year":"2015","unstructured":"Chen G, Faudree JR, Faudree RJ, Gould RJ, Jacobson MS, Magnant C (2015) Results and problems on saturation numbers for linear forests. Bull Inst Combin Appl 75:29\u201346","journal-title":"Bull Inst Combin Appl"},{"key":"1256_CR5","doi-asserted-by":"publisher","first-page":"118","DOI":"10.37236\/842","volume":"15","author":"G Chen","year":"2008","unstructured":"Chen G, Faudree RJ, Gould RJ (2008) Saturation numbers of books. Electron J Comb 15:118","journal-title":"Electron J Comb"},{"key":"1256_CR6","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1002\/jgt.20508","volume":"67","author":"Y Chen","year":"2011","unstructured":"Chen Y (2011) All minimum $$C_5$$-saturated graphs. J Graph Theory 67:9\u201326","journal-title":"J Graph Theory"},{"key":"1256_CR7","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1002\/jgt.21767","volume":"76","author":"Y Chen","year":"2014","unstructured":"Chen Y (2014) Minimum $$K_{2,3}$$-saturated graphs. J Graph Theory 76:309\u2013322","journal-title":"J Graph Theory"},{"key":"1256_CR8","first-page":"DS19","volume":"1000","author":"BL Currie","year":"2021","unstructured":"Currie BL, Faudree JR, Faudree RJ, Schmitt JR (2021) A survey of minimum saturated graphs. Electron J Comb 1000:DS19","journal-title":"Electron J Comb"},{"key":"1256_CR9","first-page":"43","volume":"24","author":"A Dudek","year":"2004","unstructured":"Dudek A, Wojda AP (2004) $$P_ {m}$$-saturated graphs with minimum size. Opuscula Math 24:43\u201355","journal-title":"Opuscula Math"},{"key":"1256_CR10","doi-asserted-by":"publisher","first-page":"1107","DOI":"10.2307\/2311408","volume":"71","author":"P Erd\u00f6s","year":"1964","unstructured":"Erd\u00f6s P, Hajnal A, Moon JW (1964) A problem in graph theory. Am Math Monthly 71:1107\u20131110","journal-title":"Am Math Monthly"},{"key":"1256_CR11","doi-asserted-by":"publisher","first-page":"91","DOI":"10.37236\/180","volume":"16","author":"J Faudree","year":"2009","unstructured":"Faudree J, Faudree RJ, Gould RJ, Jacobson MS (2009) Saturation numbers for trees. Electron. J Comb 16:91","journal-title":"Electron. J Comb"},{"key":"1256_CR12","doi-asserted-by":"publisher","first-page":"429","DOI":"10.1007\/s00373-011-1128-9","volume":"29","author":"RJ Faudree","year":"2013","unstructured":"Faudree RJ, Gould RJ (2013) Saturation numbers for nearly complete graphs. Graphs Comb 29:429\u2013448","journal-title":"Graphs Comb"},{"key":"1256_CR13","doi-asserted-by":"publisher","first-page":"5870","DOI":"10.1016\/j.disc.2008.06.036","volume":"309","author":"RJ Faudree","year":"2009","unstructured":"Faudree RJ, Ferrara M, Gould RJ, Jacobson MS (2009) $$tK_p$$-saturated graphs of minimum size. Discrete Math 309:5870\u20135876","journal-title":"Discrete Math"},{"issue":"4","key":"1256_CR14","first-page":"20","volume":"28","author":"Z He","year":"2021","unstructured":"He Z, Lu M (2021) Saturation number of $$tK_{l, l, l}$$ in the complete tripartite graph. Electron J Comb 28(4):20","journal-title":"Electron J Comb"},{"key":"1256_CR15","doi-asserted-by":"publisher","first-page":"148","DOI":"10.1016\/j.dam.2022.12.012","volume":"327","author":"Z He","year":"2023","unstructured":"He Z, Lu M, Lv Z (2023) Minimum $$tP_3$$-saturation graphs. Discrete Appl Math 327:148\u2013156","journal-title":"Discrete Appl Math"},{"key":"1256_CR16","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2023.113794","volume":"347","author":"S Huang","year":"2024","unstructured":"Huang S, Lei H, Shi Y, Zhang J (2024) The saturation number of $$ K_{3,3} $$. Discrete Math 347:113794","journal-title":"Discrete Math"},{"key":"1256_CR17","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1002\/jgt.3190100209","volume":"10","author":"L Kszonyi","year":"1986","unstructured":"Kszonyi L, Zs Tuza (1986) Saturated graphs with minimal number of edges. J Graph Theory 10:203\u2013210","journal-title":"J Graph Theory"},{"key":"1256_CR18","unstructured":"Lan Y, Shi Y, Wang Y, Zhang J (2021) The saturation number of $$C_6$$, arXiv preprint , arXiv:2108.03910"},{"key":"1256_CR19","doi-asserted-by":"publisher","first-page":"278","DOI":"10.1016\/j.dam.2019.01.009","volume":"260","author":"H Lei","year":"2019","unstructured":"Lei H, Shi SOY, West DB, Zhu X (2019) Extremal problems on saturation for the family of $$k$$-edge-connected graphs. Discrete Appl Math 260:278\u2013283","journal-title":"Discrete Appl Math"},{"key":"1256_CR20","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1007\/s10878-022-00945-z","volume":"45","author":"Z Lv","year":"2023","unstructured":"Lv Z, He Z, Lu M (2023) Saturation numbers for disjoint stars. J Comb Optim 45:11","journal-title":"J Comb Optim"},{"key":"1256_CR21","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2021.112565","volume":"344","author":"Y Ma","year":"2021","unstructured":"Ma Y, Hou X, Hei D, Gao J (2021) Minimizing the number of edges in $$C_{\\ge r}$$-saturated graphs. Discrete Math 344:112565","journal-title":"Discrete Math"},{"key":"1256_CR22","first-page":"175","volume":"104","author":"F Song","year":"2017","unstructured":"Song F (2017) Saturation numbers for linear forests $$P_4\\cup P_3\\cup tP_2$$. Util Math 104:175\u2013186","journal-title":"Util Math"},{"key":"1256_CR23","first-page":"436","volume":"48","author":"P Tur\u00e1n","year":"1941","unstructured":"Tur\u00e1n P (1941) Eine extremalaufgabe aus der graphentheorie. Mat Fiz Lapok 48:436\u2013452","journal-title":"Mat Fiz Lapok"},{"key":"1256_CR24","first-page":"161","volume":"30","author":"ZS Tuza","year":"1989","unstructured":"Tuza ZS (1989) $$C_4$$-saturated graphs of minimum size. Acta Univ Carol Math Phys 30:161\u2013167","journal-title":"Acta Univ Carol Math Phys"},{"key":"1256_CR25","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1016\/j.disc.2014.01.007","volume":"323","author":"PS Wenger","year":"2014","unstructured":"Wenger PS (2014) A note on the saturation number of the family of $$k$$-connected graphs. Discrete Math 323:81\u201383","journal-title":"Discrete Math"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-024-01256-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10878-024-01256-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-024-01256-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,13]],"date-time":"2025-03-13T21:07:03Z","timestamp":1741900023000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10878-024-01256-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,1,20]]},"references-count":25,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2025,3]]}},"alternative-id":["1256"],"URL":"https:\/\/doi.org\/10.1007\/s10878-024-01256-1","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,1,20]]},"assertion":[{"value":"30 December 2024","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 January 2025","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that they have no conflict interest regarding the publication of this paper.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"23"}}