{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T03:05:19Z","timestamp":1740107119946,"version":"3.37.3"},"reference-count":17,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2023,6,27]],"date-time":"2023-06-27T00:00:00Z","timestamp":1687824000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,6,27]],"date-time":"2023-06-27T00:00:00Z","timestamp":1687824000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["12271484"],"award-info":[{"award-number":["12271484"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2023,8]]},"DOI":"10.1007\/s00373-023-02663-7","type":"journal-article","created":{"date-parts":[[2023,6,27]],"date-time":"2023-06-27T08:03:36Z","timestamp":1687853016000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["On 4-Sachs Optimal Graphs"],"prefix":"10.1007","volume":"39","author":[{"given":"Shi-Cai","family":"Gong","sequence":"first","affiliation":[]},{"given":"Jia-Xin","family":"Wang","sequence":"additional","affiliation":[]},{"given":"Shao-Wei","family":"Sun","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,6,27]]},"reference":[{"issue":"3","key":"2663_CR1","first-page":"64","volume":"10","author":"BM Abrego","year":"2009","unstructured":"Abrego, B.M., Fern\u0107ndez Merchant, S., Neubauer, M.G., Watkins, W.: Sum of squares of degrees in a graph. J. Inequal. Pure Appl. Math. 10(3), 64 (2009)","journal-title":"J. Inequal. Pure Appl. Math."},{"issue":"10","key":"2663_CR2","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1016\/j.laa.2010.12.017","volume":"435","author":"M Andeli\u0107","year":"2011","unstructured":"Andeli\u0107, M., da Fonseca, C.M., Simi\u0107, S.K., Tos\u0306i\u0107, D.V.: On bounds for the index of double nested graphs. Linear Algebra Appl. 435(10), 193\u2013210 (2011)","journal-title":"Linear Algebra Appl."},{"key":"2663_CR3","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1007\/BF01902206","volume":"32","author":"R Ahlswede","year":"1978","unstructured":"Ahlswede, R., Katona, G.O.H.: Graphs with maximal number of adjacent pairs of edges. Acta Math. Acad. Sci. Hung. 32, 97\u2013120 (1978)","journal-title":"Acta Math. Acad. Sci. Hung."},{"key":"2663_CR4","doi-asserted-by":"publisher","first-page":"152","DOI":"10.1016\/j.disc.2005.02.016","volume":"297","author":"Y Ashkenazi","year":"2005","unstructured":"Ashkenazi, Y.: $$C_3$$ saturated graphs. Discrete Math. 297, 152\u2013158 (2005)","journal-title":"Discrete Math."},{"key":"2663_CR5","doi-asserted-by":"publisher","first-page":"2168","DOI":"10.1016\/j.laa.2008.06.018","volume":"429","author":"FK Bell","year":"2008","unstructured":"Bell, F.K., Cvetkovi\u0107, D., Rowlinson, P., Simi\u0107, S.K.: Graphs for which the least eigenvalue is minimal, II. Linear Algebra Appl. 429, 2168\u20132179 (2008)","journal-title":"Linear Algebra Appl."},{"key":"2663_CR6","doi-asserted-by":"publisher","first-page":"166","DOI":"10.1016\/0095-8956(76)90057-5","volume":"21","author":"B Bollob\u00e1s","year":"1976","unstructured":"Bollob\u00e1s, B., Erd\u00f6s, P.: On a Ramsey\u2013Tur\u00e1n type problem. J. Combin. Theory B 21, 166\u2013168 (1976)","journal-title":"J. Combin. Theory B"},{"issue":"4","key":"2663_CR7","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1002\/jgt.20530","volume":"67","author":"J Cutler","year":"2011","unstructured":"Cutler, J., Radcliff, A.J.: Extremal graphs for homomorphisms. J. Graph Theory 67(4), 261\u2013284 (2011)","journal-title":"J. Graph Theory"},{"key":"2663_CR8","volume-title":"Spectra of Graphs","author":"D Cvetkovi\u0107","year":"1980","unstructured":"Cvetkovi\u0107, D., Doob, M., Sachs, H.: Spectra of Graphs. Academic Press, New York (1980)"},{"key":"2663_CR9","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511801518","volume-title":"An Introduction to the Theory Of Graph Spectra","author":"D Cvetkovi\u0107","year":"2009","unstructured":"Cvetkovi\u0107, D., Rowlinson, P., Simi\u0107, S.: An Introduction to the Theory Of Graph Spectra. Cambridge University Press, Cambridge (2009)"},{"key":"2663_CR10","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4613-0163-9","volume-title":"Algebraic Graph Theory","author":"C Godsil","year":"2001","unstructured":"Godsil, C., Royle, G.: Algebraic Graph Theory. Springer, New York (2001)"},{"issue":"3","key":"2663_CR11","doi-asserted-by":"publisher","first-page":"38","DOI":"10.1007\/s00373-022-02461-7","volume":"38","author":"SC Gong","year":"2022","unstructured":"Gong, S.C., Zhang, L.P., Sun, S.W.: On bipartite graphs having minimal fourth adjacency coefficient. Graphs Combin. 38(3), 38\u201360 (2022)","journal-title":"Graphs Combin."},{"issue":"1","key":"2663_CR12","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1016\/0166-218X(90)90092-Q","volume":"28","author":"PL Hammer","year":"1990","unstructured":"Hammer, P.L., Peled, U.N., Sun, X.R.: Difference graphs. Discrete Appl. Math. 28(1), 35\u201344 (1990)","journal-title":"Discrete Appl. Math."},{"key":"2663_CR13","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1002\/jgt.3190100209","volume":"10","author":"L K\u00e1szonyi","year":"1986","unstructured":"K\u00e1szonyi, L., Tuza, Z.: Saturated graphs with minimal number of edges. J. Graph Theory 10, 203\u2013210 (1986)","journal-title":"J. Graph Theory"},{"issue":"6","key":"2663_CR14","doi-asserted-by":"publisher","first-page":"703","DOI":"10.1007\/s00493-014-3188-y","volume":"36","author":"L Keough","year":"2016","unstructured":"Keough, L., Radcliffe, A.J.: Graphs with the fewest matchings. Combinatorica 36(6), 703\u2013723 (2016)","journal-title":"Combinatorica"},{"key":"2663_CR15","volume-title":"Threshold Graphs and Related Topics","author":"NVR Mahadev","year":"1995","unstructured":"Mahadev, N.V.R., Peled, U.N.: Threshold Graphs and Related Topics. Elsevier, London (1995)"},{"key":"2663_CR16","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1016\/0095-8956(72)90023-8","volume":"12","author":"A Mowshowitz","year":"1972","unstructured":"Mowshowitz, A.: The characteristic polynomial of a graph. J. Combin. Theory B 12, 177\u2013193 (1972)","journal-title":"J. Combin. Theory B"},{"key":"2663_CR17","doi-asserted-by":"publisher","first-page":"351","DOI":"10.1137\/0603036","volume":"3","author":"M Yannakakis","year":"1982","unstructured":"Yannakakis, M.: The complexity of the partial order dimension problem. SIAM J. Algebraic Discrete Methods 3, 351\u2013358 (1982)","journal-title":"SIAM J. Algebraic Discrete Methods"}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-023-02663-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00373-023-02663-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-023-02663-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,8,10]],"date-time":"2023-08-10T11:32:11Z","timestamp":1691667131000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00373-023-02663-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,6,27]]},"references-count":17,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2023,8]]}},"alternative-id":["2663"],"URL":"https:\/\/doi.org\/10.1007\/s00373-023-02663-7","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"type":"print","value":"0911-0119"},{"type":"electronic","value":"1435-5914"}],"subject":[],"published":{"date-parts":[[2023,6,27]]},"assertion":[{"value":"23 May 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"25 May 2023","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"25 May 2023","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 June 2023","order":4,"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 of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"74"}}