{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:19:34Z","timestamp":1740122374951,"version":"3.37.3"},"reference-count":11,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2024,10,14]],"date-time":"2024-10-14T00:00:00Z","timestamp":1728864000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,10,14]],"date-time":"2024-10-14T00:00:00Z","timestamp":1728864000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2024,11]]},"DOI":"10.1007\/s10878-024-01222-x","type":"journal-article","created":{"date-parts":[[2024,10,14]],"date-time":"2024-10-14T14:02:52Z","timestamp":1728914572000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Explicit construction of mixed dominating sets in generalized Petersen graphs"],"prefix":"10.1007","volume":"48","author":[{"ORCID":"https:\/\/orcid.org\/0009-0008-1817-3010","authenticated-orcid":false,"given":"Meysam","family":"Rajaati\u00a0Bavil\u00a0Olyaei","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2089-0250","authenticated-orcid":false,"given":"Mohsen","family":"Alambardar Meybodi","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3834-3610","authenticated-orcid":false,"given":"Mohammad Reza","family":"Hooshmandasl","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2253-1166","authenticated-orcid":false,"given":"Ali","family":"Shakiba","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,10,14]]},"reference":[{"issue":"2","key":"1222_CR1","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1002\/jgt.3190010209","volume":"1","author":"Y Alavi","year":"1977","unstructured":"Alavi Y, Behzad M, Lesniak-Foster LM, Nordhaus E (1977) Total matchings and total coverings of graphs. J Graph Theory 1(2):135\u2013140","journal-title":"J Graph Theory"},{"issue":"4","key":"1222_CR2","doi-asserted-by":"publisher","first-page":"603","DOI":"10.1016\/j.disc.2007.03.024","volume":"308","author":"A Behzad","year":"2008","unstructured":"Behzad A, Behzad M, Praeger CE (2008) On the domination number of the generalized Petersen graphs. Discret Math 308(4):603\u2013610","journal-title":"Discret Math"},{"issue":"6","key":"1222_CR3","doi-asserted-by":"publisher","first-page":"406","DOI":"10.1002\/jcd.20054","volume":"13","author":"M Boben","year":"2005","unstructured":"Boben M, Pisanski T, \u017ditnik A (2005) I-graphs and the corresponding configurations. J Comb Des 13(6):406\u2013424","journal-title":"J Comb Des"},{"issue":"13","key":"1222_CR4","doi-asserted-by":"publisher","first-page":"4355","DOI":"10.1016\/j.disc.2009.01.018","volume":"309","author":"BJ Ebrahimi","year":"2009","unstructured":"Ebrahimi BJ, Jahanbakht N, Mahmoodian ES (2009) Vertex domination of generalized Petersen graphs. Discret Math 309(13):4355\u20134361","journal-title":"Discret Math"},{"issue":"8","key":"1222_CR5","doi-asserted-by":"publisher","first-page":"2445","DOI":"10.1016\/j.disc.2008.05.026","volume":"309","author":"X Fu","year":"2009","unstructured":"Fu X, Yang Y, Jiang B (2009) On the domination number of generalized Petersen graphs p (n, 2). Discret Math 309(8):2445\u20132451","journal-title":"Discret Math"},{"key":"1222_CR6","unstructured":"Hedetniemi SM, Hedetniemi ST, Laskar R, McRae A, Majumdar A (1995) Domination, independence and irredundance in total graphs: a brief survey. In: Graph theory, combinatorics and applications: proceedings of the 7th quadrennial international conference on the theory and applications of graphs, vol.\u00a02, pp\u00a0671\u2013683"},{"key":"1222_CR7","doi-asserted-by":"publisher","first-page":"84","DOI":"10.1016\/j.tcs.2012.11.035","volume":"476","author":"JK Lan","year":"2013","unstructured":"Lan JK, Chang GJ (2013) On the mixed domination problem in graphs. Theoret Comput Sci 476:84\u201393","journal-title":"Theoret Comput Sci"},{"key":"1222_CR8","unstructured":"Majumdar A (1992) Neighborhood hypergraphs: a framework for covering and packing parameters in graphs. PhD thesis, Clemson University"},{"issue":"1\u20133","key":"1222_CR9","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1016\/S0166-218X(98)00147-4","volume":"91","author":"DF Manlove","year":"1999","unstructured":"Manlove DF (1999) On the algorithmic complexity of twelve covering and independence parameters of graphs. Discret Appl Math 91(1\u20133):155\u2013175","journal-title":"Discret Appl Math"},{"issue":"8","key":"1222_CR10","doi-asserted-by":"publisher","first-page":"2596","DOI":"10.1016\/j.disc.2008.04.026","volume":"309","author":"H Yan","year":"2009","unstructured":"Yan H, Kang L, Xu G (2009) The exact domination number of the generalized Petersen graphs. Discret Math 309(8):2596\u20132607","journal-title":"Discret Math"},{"issue":"22","key":"1222_CR11","doi-asserted-by":"publisher","first-page":"2387","DOI":"10.1016\/j.tcs.2011.01.029","volume":"412","author":"Y Zhao","year":"2011","unstructured":"Zhao Y, Kang L, Sohn MY (2011) The algorithmic complexity of mixed domination in graphs. Theoret Comput Sci 412(22):2387\u20132392","journal-title":"Theoret Comput Sci"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-024-01222-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10878-024-01222-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-024-01222-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,11,7]],"date-time":"2024-11-07T11:04:44Z","timestamp":1730977484000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10878-024-01222-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,10,14]]},"references-count":11,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2024,11]]}},"alternative-id":["1222"],"URL":"https:\/\/doi.org\/10.1007\/s10878-024-01222-x","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"type":"print","value":"1382-6905"},{"type":"electronic","value":"1573-2886"}],"subject":[],"published":{"date-parts":[[2024,10,14]]},"assertion":[{"value":"5 October 2024","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"14 October 2024","order":2,"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 no Conflict of interest to declare that are relevant to the content of this article.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"29"}}