{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:20:23Z","timestamp":1740122423493,"version":"3.37.3"},"reference-count":23,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2022,1,13]],"date-time":"2022-01-13T00:00:00Z","timestamp":1642032000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,13]],"date-time":"2022-01-13T00:00:00Z","timestamp":1642032000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"name":"Training Program for Innovation of Yangtze University","award":["Yz2020324"],"award-info":[{"award-number":["Yz2020324"]}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62076039"],"award-info":[{"award-number":["62076039"]}],"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":[[2022,8]]},"DOI":"10.1007\/s10878-021-00843-w","type":"journal-article","created":{"date-parts":[[2022,1,13]],"date-time":"2022-01-13T17:02:44Z","timestamp":1642093364000},"page":"435-445","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["The signed edge-domatic number of nearly cubic graphs"],"prefix":"10.1007","volume":"44","author":[{"given":"Jia-Xiong","family":"Dan","sequence":"first","affiliation":[]},{"given":"Zhi-Bo","family":"Zhu","sequence":"additional","affiliation":[]},{"given":"Xin-Kui","family":"Yang","sequence":"additional","affiliation":[]},{"given":"Ru-Yi","family":"Li","sequence":"additional","affiliation":[]},{"given":"Wei-Jie","family":"Zhao","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1194-1124","authenticated-orcid":false,"given":"Xiang-Jun","family":"Li","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,1,13]]},"reference":[{"key":"843_CR1","doi-asserted-by":"publisher","first-page":"1850020","DOI":"10.1142\/S1793830918500209","volume":"10","author":"J Amjadi","year":"2018","unstructured":"Amjadi J (2018) The signed total Roman domatic number of a digraph. Discrete Math Algorithms Appl 10:1850020","journal-title":"Discrete Math Algorithms Appl"},{"issue":"1","key":"843_CR2","first-page":"17","volume":"6","author":"J Amjadi","year":"2021","unstructured":"Amjadi J (2021) Twin signed total Roman domatic numbers in digraphs. Commun Comb Optim 6(1):17\u201326","journal-title":"Commun Comb Optim"},{"key":"843_CR3","doi-asserted-by":"publisher","first-page":"125444","DOI":"10.1016\/j.amc.2020.125444","volume":"391","author":"HA Ahangar","year":"2021","unstructured":"Ahangar HA, \u00c1lvarez-Ruiz MP, Chellali M, Sheikholeslami SM, Valenzuela-Tripodoro JC (2021) Triple Roman domination in graphs. Appl Math Comput 391:125444","journal-title":"Appl Math Comput"},{"key":"843_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.dam.2018.09.009","volume":"257","author":"HA Ahangar","year":"2019","unstructured":"Ahangar HA, Chellali M, Sheikholeslami SM (2019) Signed double Roman domination in graphs. Discrete Appl Math 257:1\u201311","journal-title":"Discrete Appl Math"},{"key":"843_CR5","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1007\/s10878-012-9500-0","volume":"27","author":"HA Ahangar","year":"2014","unstructured":"Ahangar HA, Henning MA, L\u00f6wenstein C, Zhao Y, Samodivkin V (2014) Signed Roman domination in graphs. J Comb Optim 27:241\u2013255","journal-title":"J Comb Optim"},{"key":"843_CR6","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1016\/j.dam.2009.09.015","volume":"158","author":"M Atapour","year":"2010","unstructured":"Atapour M, Sheikholeslami SM, Ghameshloub AN, Volkmann L (2010) Note signed star domatic number of a graph. Discrete Appl Math 158:213\u2013218","journal-title":"Discrete Appl Math"},{"key":"843_CR7","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1002\/net.3230070305","volume":"7","author":"EJ Cockayne","year":"1977","unstructured":"Cockayne EJ, Hedetniemi ST (1977) Towards a theory of domination in graphs. Networks 7:247\u2013261","journal-title":"Networks"},{"key":"843_CR8","doi-asserted-by":"publisher","first-page":"162","DOI":"10.1007\/s10878-010-9374-y","volume":"24","author":"J Chen","year":"2012","unstructured":"Chen J, Hou X-M, Li N (2012) The total {$$k$$}-domatic number of wheels and complete graphs. J Comb Optim 24:162\u2013175","journal-title":"J Comb Optim"},{"key":"843_CR9","first-page":"311","volume-title":"Graph theory, combinatorics, and applications","author":"JE Dunbar","year":"1995","unstructured":"Dunbar JE, Hedetniemi ST, Henning MA, Slater PJ (1995) Signed domination in graphs. In: Alavi Y, Schwenk A (eds) Graph theory, combinatorics, and applications. Wiley, New York, pp 311\u2013322"},{"key":"843_CR10","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1016\/0095-8956(80)90087-8","volume":"29","author":"RC Entringer","year":"1980","unstructured":"Entringer RC, Swart H (1980) Spanning cycles of nearly cubic graphs. J Combin Theory Ser B 29:303\u2013309","journal-title":"J Combin Theory Ser B"},{"issue":"1","key":"843_CR11","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1007\/s11741-008-0106-3","volume":"12","author":"M Guan","year":"2008","unstructured":"Guan M, Shan E-F (2008) Signed total domatic number of a graph. J Shanghai Univ 12(1):31\u201334","journal-title":"J Shanghai Univ"},{"issue":"1","key":"843_CR12","doi-asserted-by":"publisher","first-page":"4","DOI":"10.1007\/s11741-006-0097-3","volume":"10","author":"L-Y Kang","year":"2006","unstructured":"Kang L-Y, Shan E-F (2006) Signed total domination in nearly regular graphs. J Shanghai Univ 10(1):4\u20138","journal-title":"J Shanghai Univ"},{"issue":"6","key":"843_CR13","doi-asserted-by":"publisher","first-page":"1881","DOI":"10.1007\/s00373-012-1234-3","volume":"29","author":"X-J Li","year":"2013","unstructured":"Li X-J, Xu J-M (2013) The signed edge-domatic number of a graph. Graphs Combin 29(6):1881\u20131890","journal-title":"Graphs Combin"},{"key":"843_CR14","doi-asserted-by":"publisher","first-page":"1295","DOI":"10.1016\/j.aml.2010.06.016","volume":"23","author":"SM Sheikholeslami","year":"2010","unstructured":"Sheikholeslami SM, Volkmann L (2010) The Roman domatic number of a graph. Appl Math Lett 23:1295\u20131300","journal-title":"Appl Math Lett"},{"key":"843_CR15","first-page":"139","volume":"37","author":"SM Sheikholeslami","year":"2010","unstructured":"Sheikholeslami SM, Volkmann L (2010) Signed $$(k, k)$$-domatic number of a graph. Ann Math Inform 37:139\u2013149","journal-title":"Ann Math Inform"},{"key":"843_CR16","doi-asserted-by":"publisher","first-page":"252","DOI":"10.1007\/s10878-010-9352-4","volume":"23","author":"SM Sheikholeslami","year":"2012","unstructured":"Sheikholeslami SM, Volkmann L (2012) The total $$\\{k\\}$$-domatic number of a graph. J Comb Optim 23:252\u2013260","journal-title":"J Comb Optim"},{"key":"843_CR17","first-page":"105","volume":"40","author":"SM Sheikholeslami","year":"2012","unstructured":"Sheikholeslami SM, Volkmann L (2012) The signed Roman domatic number of a graph. Ann Math Inform 40:105\u2013112","journal-title":"Ann Math Inform"},{"issue":"8","key":"843_CR18","doi-asserted-by":"publisher","first-page":"832","DOI":"10.1016\/j.dam.2011.01.018","volume":"159","author":"L Volkmann","year":"2011","unstructured":"Volkmann L (2011) Upper bounds on the signed total domatic number of graphs. Discrete Appl Math 159(8):832\u2013837","journal-title":"Discrete Appl Math"},{"key":"843_CR19","doi-asserted-by":"publisher","first-page":"150","DOI":"10.1016\/j.dam.2014.07.030","volume":"180","author":"L Volkmann","year":"2015","unstructured":"Volkmann L (2015) The signed Roman $$k$$-domatic number of a graph. Discrete Appl Math 180:150\u2013157","journal-title":"Discrete Appl Math"},{"key":"843_CR20","doi-asserted-by":"publisher","first-page":"1527","DOI":"10.1007\/s40840-014-0104-y","volume":"38","author":"L Volkmann","year":"2015","unstructured":"Volkmann L (2015) Upper bounds on the signed $$(k, k)$$-domatic number of digraphs. Bull Malays Math Sci Soc 38:1527\u20131536","journal-title":"Bull Malays Math Sci Soc"},{"key":"843_CR21","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1016\/j.dam.2004.08.010","volume":"150","author":"L Volkmann","year":"2005","unstructured":"Volkmann L, Zelinka B (2005) Signed domatic number of a graph. Discrete Appl Math 150:261\u2013267","journal-title":"Discrete Appl Math"},{"key":"843_CR22","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1016\/S0012-365X(01)00044-9","volume":"239","author":"B-G Xu","year":"2001","unstructured":"Xu B-G (2001) On signed edge domination numbers of graphs. Discrete Math 239:179\u2013198","journal-title":"Discrete Math"},{"key":"843_CR23","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4419-8698-6","volume-title":"Theory and application of graphs","author":"J-M Xu","year":"2003","unstructured":"Xu J-M (2003) Theory and application of graphs. Kluwer Academic Publishers, Dordrecht\/Boston\/London"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-021-00843-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10878-021-00843-w\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-021-00843-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,29]],"date-time":"2022-07-29T07:30:52Z","timestamp":1659079852000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10878-021-00843-w"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,1,13]]},"references-count":23,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2022,8]]}},"alternative-id":["843"],"URL":"https:\/\/doi.org\/10.1007\/s10878-021-00843-w","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"type":"print","value":"1382-6905"},{"type":"electronic","value":"1573-2886"}],"subject":[],"published":{"date-parts":[[2022,1,13]]},"assertion":[{"value":"21 December 2021","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 January 2022","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declartions"}},{"value":"We declare that we have no financial and personal relationships with other people or organizations that can inappropriately influence our work and there is no professional or other personal interest of any nature that can influence the review of the manuscript.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}