{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T03:05:11Z","timestamp":1740107111537,"version":"3.37.3"},"reference-count":8,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2022,8,14]],"date-time":"2022-08-14T00:00:00Z","timestamp":1660435200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,8,14]],"date-time":"2022-08-14T00:00:00Z","timestamp":1660435200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2022,10]]},"DOI":"10.1007\/s00373-022-02521-y","type":"journal-article","created":{"date-parts":[[2022,8,14]],"date-time":"2022-08-14T16:04:15Z","timestamp":1660493055000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["On the Forcing Domination and the Forcing Total Domination Numbers of a Graph"],"prefix":"10.1007","volume":"38","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-4715-5638","authenticated-orcid":false,"given":"J.","family":"John","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"V. Sujin","family":"Flower","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,8,14]]},"reference":[{"key":"2521_CR1","first-page":"161","volume":"25","author":"G Chartrand","year":"1997","unstructured":"Chartrand, G., Galvas, H., Harary, F., Vandell, R.C.: The forcing domination number of a graph. J. Comb. Math. Comb. Comput. 25, 161\u2013174 (1997)","journal-title":"J. Comb. Math. Comb. Comput."},{"key":"2521_CR2","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1002\/net.3230100304","volume":"10","author":"EJ Cochaye","year":"1980","unstructured":"Cochaye, E.J., Dawes, R.M., Hedetnieni, S.T.: Total domination in graphs. Networks 10, 211\u2013219 (1980)","journal-title":"Networks"},{"key":"2521_CR3","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1002\/(SICI)1097-0118(200005)34:1<9::AID-JGT2>3.0.CO;2-O","volume":"34","author":"O Favaron","year":"2000","unstructured":"Favaron, O., Henning, M.A., Mynhart, C., Puech, J.: Total domination in graphs with minimum degree three. J. Graph Theory 34, 9\u201319 (2000)","journal-title":"J. Graph Theory"},{"key":"2521_CR4","volume-title":"Fundamentals of Domination in Graphs","author":"TW Haynes","year":"1998","unstructured":"Haynes, T.W., Hedetniemi, S.T., Slater, P.J.: Fundamentals of Domination in Graphs. Marcel Dekker, New York (1998)"},{"key":"2521_CR5","first-page":"1","volume":"14","author":"MA Henning","year":"2007","unstructured":"Henning, M.A., Yeo, A.: A new upper bound on the total domination number of a graph. Electron. J. Comb. 14, 1\u201310 (2007)","journal-title":"Electron. J. Comb."},{"key":"2521_CR6","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1016\/j.disc.2007.12.044","volume":"309","author":"MA Henning","year":"2009","unstructured":"Henning, M.A.: A survey of selected recent results on total domination in graphs. Discret. Math. 309, 32\u201363 (2009)","journal-title":"Discret. Math."},{"key":"2521_CR7","first-page":"223","volume":"72","author":"PCB Lam","year":"2007","unstructured":"Lam, P.C.B., Wei, B.: On the total domination number of graphs. Utilitas Mathematica 72, 223\u2013240 (2007)","journal-title":"Utilitas Mathematica"},{"key":"2521_CR8","first-page":"3","volume":"62","author":"P Zhang","year":"2012","unstructured":"Zhang, P.: The upper forcing geodetic number of a graph. Ars Comb. 62, 3\u201315 (2012)","journal-title":"Ars Comb."}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-022-02521-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00373-022-02521-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-022-02521-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,11,2]],"date-time":"2022-11-02T19:43:58Z","timestamp":1667418238000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00373-022-02521-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,8,14]]},"references-count":8,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2022,10]]}},"alternative-id":["2521"],"URL":"https:\/\/doi.org\/10.1007\/s00373-022-02521-y","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"type":"print","value":"0911-0119"},{"type":"electronic","value":"1435-5914"}],"subject":[],"published":{"date-parts":[[2022,8,14]]},"assertion":[{"value":"16 July 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 June 2022","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"24 June 2022","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"14 August 2022","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 no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"142"}}