{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T03:05:09Z","timestamp":1740107109762,"version":"3.37.3"},"reference-count":8,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2022,3,14]],"date-time":"2022-03-14T00:00:00Z","timestamp":1647216000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,3,14]],"date-time":"2022-03-14T00:00:00Z","timestamp":1647216000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100002398","name":"Sharif University of Technology","doi-asserted-by":"publisher","award":["G981202"],"award-info":[{"award-number":["G981202"]}],"id":[{"id":"10.13039\/501100002398","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":[[2022,6]]},"DOI":"10.1007\/s00373-022-02470-6","type":"journal-article","created":{"date-parts":[[2022,3,14]],"date-time":"2022-03-14T16:05:32Z","timestamp":1647273932000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Some Results on Dominating Induced Matchings"],"prefix":"10.1007","volume":"38","author":[{"given":"S.","family":"Akbari","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"H.","family":"Baktash","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"A.","family":"Behjati","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7751-5203","authenticated-orcid":false,"given":"A.","family":"Behmaram","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"M.","family":"Roghani","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,3,14]]},"reference":[{"key":"2470_CR1","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1016\/j.dam.2016.01.012","volume":"234","author":"E Andrade","year":"2018","unstructured":"Andrade, E., Cardoso, D.M., Medina, L., Rojo, O.: On the dominating induced matching problem: spectral results and sharp bounds. Discrete Appl. Math. 234, 22\u201331 (2018)","journal-title":"Discrete Appl. Math."},{"issue":"4","key":"2470_CR2","doi-asserted-by":"publisher","first-page":"998","DOI":"10.1007\/s00453-012-9709-4","volume":"68","author":"A Brandst\u00e4dt","year":"2014","unstructured":"Brandst\u00e4dt, A., Mosca, R.: Dominating induced matchings for P7-free graphs in linear time. Algorithmica 68(4), 998\u20131018 (2014)","journal-title":"Algorithmica"},{"key":"2470_CR3","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1016\/0166-218X(92)90275-F","volume":"24","author":"K Cameron","year":"1989","unstructured":"Cameron, K.: Induced matchings. Discrete Appl. Math. 24, 97\u2013102 (1989)","journal-title":"Discrete Appl. Math."},{"key":"2470_CR4","doi-asserted-by":"publisher","first-page":"521","DOI":"10.1016\/j.dam.2010.03.011","volume":"159","author":"DM Cardoso","year":"2011","unstructured":"Cardoso, D.M., Korpelainen, N., Lozin, V.V.: On the complexity of the dominating induced matching problem in hereditary classes of graphs. Discrete Appl. Math. 159, 521\u2013531 (2011)","journal-title":"Discrete Appl. Math."},{"key":"2470_CR5","doi-asserted-by":"publisher","first-page":"3060","DOI":"10.1016\/j.dam.2008.01.021","volume":"156","author":"DM Cardoso","year":"2008","unstructured":"Cardoso, D.M., Cerdeira, J., Delorme, C., Silva, P.: Efficient edge domination in regular graph. Discrete Appl. Math. 156, 3060\u20133065 (2008)","journal-title":"Discrete Appl. Math."},{"key":"2470_CR6","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1016\/0020-0190(93)90084-M","volume":"48","author":"DL Grinstead","year":"1993","unstructured":"Grinstead, D.L., Slater, P.J., Sherwani, N.A., Holmes, N.D.: Eficient edge domination problems in graphs. Inf. Process. Lett. 48, 221\u2013228 (1993)","journal-title":"Inf. Process. Lett."},{"key":"2470_CR7","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1002\/jgt.22182","volume":"88","author":"A Hertz","year":"2018","unstructured":"Hertz, A., Lozin, V., Ries, B., Zamaraev, V., DeWerra, D.: Dominating induced matchings in graphs containing no long claw. J. Graph Theory 88, 18\u201339 (2018)","journal-title":"J. Graph Theory"},{"key":"2470_CR8","doi-asserted-by":"crossref","unstructured":"Livingston, M., Stout, Q.F.: Distributing resources in hypercube computers. In: Proceedings of the Third Conference on Hypercube Concurrent Computers and Applications, pp. 222\u2013231 (1988)","DOI":"10.1145\/62297.62324"}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-022-02470-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00373-022-02470-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-022-02470-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,6,9]],"date-time":"2022-06-09T22:42:04Z","timestamp":1654814524000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00373-022-02470-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,3,14]]},"references-count":8,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2022,6]]}},"alternative-id":["2470"],"URL":"https:\/\/doi.org\/10.1007\/s00373-022-02470-6","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"type":"print","value":"0911-0119"},{"type":"electronic","value":"1435-5914"}],"subject":[],"published":{"date-parts":[[2022,3,14]]},"assertion":[{"value":"4 May 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 February 2022","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 February 2022","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"14 March 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 have not disclosed any competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}}],"article-number":"73"}}