{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,5]],"date-time":"2025-03-05T05:16:37Z","timestamp":1741151797281,"version":"3.38.0"},"reference-count":20,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2024,11,17]],"date-time":"2024-11-17T00:00:00Z","timestamp":1731801600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,11,17]],"date-time":"2024-11-17T00:00:00Z","timestamp":1731801600000},"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":["12061073"],"award-info":[{"award-number":["12061073"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Comp. Appl. Math."],"published-print":{"date-parts":[[2025,2]]},"DOI":"10.1007\/s40314-024-03001-0","type":"journal-article","created":{"date-parts":[[2024,11,17]],"date-time":"2024-11-17T11:44:54Z","timestamp":1731843894000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["The outdegree power of oriented graphs"],"prefix":"10.1007","volume":"44","author":[{"given":"Yuhe","family":"Ren","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7164-3116","authenticated-orcid":false,"given":"Baoyindureng","family":"Wu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,11,17]]},"reference":[{"key":"3001_CR1","doi-asserted-by":"publisher","first-page":"R42","DOI":"10.37236\/1795","volume":"11","author":"B Bollob\u00e1s","year":"2004","unstructured":"Bollob\u00e1s B, Nikiforov V (2004) Degree powers in graphs with forbidden subgraphs. Electorn J Combin 11:R42","journal-title":"Electorn J Combin"},{"key":"3001_CR2","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1017\/S0963548311000654","volume":"21","author":"B Bollob\u00e1s","year":"2012","unstructured":"Bollob\u00e1s B, Nikiforov V (2012) Degpree powers in graphs: the Erdos\u2013Stone theorem. Combin Probab Comput 21:89\u2013105","journal-title":"Combin Probab Comput"},{"key":"3001_CR3","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. Macmillan, New York"},{"issue":"14","key":"3001_CR4","doi-asserted-by":"publisher","first-page":"Research Paper","DOI":"10.37236\/1525","volume":"7","author":"Y Caro","year":"2000","unstructured":"Caro Y, Yuster R (2000) A Tur\u00e1n type problem concerning the powers of the degrees of a graph. Electron J Combin 7(14):Research Paper 47","journal-title":"Electron J Combin"},{"key":"3001_CR5","doi-asserted-by":"publisher","first-page":"1959","DOI":"10.1016\/j.disc.2006.03.054","volume":"306","author":"SM Cioab\u01ce","year":"2006","unstructured":"Cioab\u01ce SM (2006) Sums of powers of the degrees of a graph. Discrete Math 306:1959\u20131964","journal-title":"Discrete Math"},{"key":"3001_CR6","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1016\/j.dam.2012.11.001","volume":"165","author":"J Czap","year":"2014","unstructured":"Czap J, Harant J, Hud\u00e1k D (2014) An upper bound on the sum of powers of the degrees of simple 1-planar graphs. Discrete Appl Math 165:146\u2013151","journal-title":"Discrete Appl Math"},{"key":"3001_CR7","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1016\/j.disc.2004.04.007","volume":"285","author":"KC Das","year":"2004","unstructured":"Das KC (2004) Maximizing the sum of the squares of the degrees in a graph. Discrete Math 285:57\u201366","journal-title":"Discrete Math"},{"key":"3001_CR8","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1016\/S0012-365X(97)00213-6","volume":"185","author":"D de Caen","year":"1998","unstructured":"de Caen D (1998) An upper bound on the sum of squares of degrees in a graph. Discrete Math 185:245\u2013248","journal-title":"Discrete Math"},{"key":"3001_CR9","doi-asserted-by":"publisher","first-page":"1557","DOI":"10.1016\/j.disc.2008.02.027","volume":"309","author":"TC Edwin Cheng","year":"2009","unstructured":"Edwin Cheng TC, Guo Y, Zhang S, Du Y (2009) Extreme values of the sum of squares of degrees of bipartite graphs. Discrete Math 309:1557\u20131564","journal-title":"Discrete Math"},{"key":"3001_CR10","doi-asserted-by":"publisher","first-page":"2613","DOI":"10.1016\/j.disc.2008.03.025","volume":"309","author":"MA Fiol","year":"2009","unstructured":"Fiol MA, Garriga E (2009) Number of walks and degree powers in a graph. Discrete Math 309:2613\u20132614","journal-title":"Discrete Math"},{"key":"3001_CR11","doi-asserted-by":"publisher","first-page":"1627","DOI":"10.1007\/s40840-014-0106-9","volume":"38","author":"R Gu","year":"2015","unstructured":"Gu R, Li X, Shi Y (2015) Degree powers in $$C_{5}$$-free graphs. Bull Malays Math Sci Soc 38:1627\u20131635","journal-title":"Bull Malays Math Sci Soc"},{"key":"3001_CR12","doi-asserted-by":"publisher","first-page":"112","DOI":"10.1002\/jgt.20519","volume":"67","author":"J Harant","year":"2011","unstructured":"Harant J, Jendrol S, Madaras T (2011) Upper bounds on the sum of powers of the degrees of a simple planar graph. J Graph Theory 67:112\u2013123","journal-title":"J Graph Theory"},{"key":"3001_CR13","first-page":"425","volume":"54","author":"Y Hu","year":"2005","unstructured":"Hu Y, Li X, Shi Y, Xu T, Gutman I (2005) On molecular graphs with smallest and greatest zeroth-order general Randi\u0107 index. MATCH Commun Math Comput Chem 54:425\u2013434","journal-title":"MATCH Commun Math Comput Chem"},{"key":"3001_CR14","doi-asserted-by":"publisher","first-page":"821","DOI":"10.1016\/j.disc.2018.11.013","volume":"342","author":"Y Lan","year":"2019","unstructured":"Lan Y, Liu H, Qin Z, Shi Y (2019) Degree powers in graphs with a forbidden forest. Discrete Math 342:821\u2013835","journal-title":"Discrete Math"},{"key":"3001_CR15","doi-asserted-by":"publisher","first-page":"727","DOI":"10.1007\/s00373-010-0996-8","volume":"27","author":"S Li","year":"2011","unstructured":"Li S, Yan L (2011) Sums of powers of the degrees of graphs with $$k$$ cut edges. Graphs Comb 27:727\u2013740","journal-title":"Graphs Comb"},{"key":"3001_CR16","doi-asserted-by":"publisher","first-page":"258","DOI":"10.1017\/S0963548320000462","volume":"30","author":"H Lin","year":"2021","unstructured":"Lin H, Ning B, Wu B (2021) Eigenvalues and triangles in graphs. Combin Probab Comput 30:258\u2013270","journal-title":"Combin Probab Comput"},{"key":"3001_CR17","doi-asserted-by":"publisher","first-page":"Research Paper","DOI":"10.37236\/196","volume":"16","author":"V Nikiforov","year":"2009","unstructured":"Nikiforov V (2009) Degree powers in graphs with a forbidden even cycle. Electron J Combin 16:Research Paper 107","journal-title":"Electron J Combin"},{"key":"3001_CR18","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1002\/(SICI)1097-0118(199908)31:4<283::AID-JGT3>3.0.CO;2-H","volume":"31","author":"UN Peled","year":"1999","unstructured":"Peled UN, Petreschi R, Sterbini A (1999) $$(n, e)$$-Graphs with maximum sum of squares of degrees. J Graph Theory 31:283\u2013295","journal-title":"J Graph Theory"},{"key":"3001_CR19","volume":"433","author":"C Xu","year":"2022","unstructured":"Xu C, You Z, Zhang L, Zhou M (2022) The maximum outdegree power of complete $$k$$-partite oriented graphs. Appl Math Comput 433:127414","journal-title":"Appl Math Comput"},{"key":"3001_CR20","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2021.112783","volume":"345","author":"L Zhang","year":"2022","unstructured":"Zhang L (2022) Degree powers in $$K_{s, t}$$-minor free graphs. Discrete Math 345:112783","journal-title":"Discrete Math"}],"container-title":["Computational and Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s40314-024-03001-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s40314-024-03001-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s40314-024-03001-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,4]],"date-time":"2025-03-04T05:16:51Z","timestamp":1741065411000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s40314-024-03001-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,11,17]]},"references-count":20,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2025,2]]}},"alternative-id":["3001"],"URL":"https:\/\/doi.org\/10.1007\/s40314-024-03001-0","relation":{},"ISSN":["2238-3603","1807-0302"],"issn-type":[{"type":"print","value":"2238-3603"},{"type":"electronic","value":"1807-0302"}],"subject":[],"published":{"date-parts":[[2024,11,17]]},"assertion":[{"value":"7 March 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 October 2024","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"30 October 2024","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 November 2024","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":"37"}}