{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,1]],"date-time":"2024-07-01T18:31:05Z","timestamp":1719858665509},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2015,4,28]],"date-time":"2015-04-28T00:00:00Z","timestamp":1430179200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2016,7]]},"DOI":"10.1007\/s10878-015-9879-5","type":"journal-article","created":{"date-parts":[[2015,4,27]],"date-time":"2015-04-27T09:57:28Z","timestamp":1430128648000},"page":"299-317","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Signed mixed Roman domination numbers in graphs"],"prefix":"10.1007","volume":"32","author":[{"given":"H. Abdollahzadeh","family":"Ahangar","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"L.","family":"Asgharsharghi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"S. M.","family":"Sheikholeslami","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"L.","family":"Volkmann","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,4,28]]},"reference":[{"key":"9879_CR1","doi-asserted-by":"publisher","unstructured":"Abdollahzadeh Ahangar H, Amjadi J, Sheikholeslami SM, Volkmann L, Zhao Y (2014a) Signed Roman edge domination numbers in graphs. J Comb Optim. doi: 10.1007\/s10878-014-9747-8","DOI":"10.1007\/s10878-014-9747-8"},{"key":"9879_CR2","doi-asserted-by":"crossref","unstructured":"Abdollahzadeh Ahangar H, Henning MA, L\u00f6wenstein C, Zhao Y, Samodivkin V (2014b) Signed Roman domination in graphs. J Comb Optim 27:241\u2013255","DOI":"10.1007\/s10878-012-9500-0"},{"key":"9879_CR3","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1002\/jgt.3190010209","volume":"1","author":"Y Alavi","year":"1977","unstructured":"Alavi Y, Behzad M, Lesniak-Foster LM, Nordhaus EA (1977) Total matchings and total coverings of graphs. J Graph Theory 1:135\u2013140","journal-title":"J Graph Theory"},{"key":"9879_CR4","unstructured":"Dunbar JE, Hedetniemi ST, Henning MA, Slater PJ (1995) Signed domination in graphs. Graph theory, combinatorics, and applications. Wiley, New York, pp 311\u2013322"},{"key":"9879_CR5","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1016\/0012-365X(77)90102-9","volume":"19","author":"P Erd\u00f6s","year":"1977","unstructured":"Erd\u00f6s P, Meir A (1977) On total matching numbers and total covering numbers of complementary graphs. Discrete Math 19:229\u2013233","journal-title":"Discrete Math"},{"key":"9879_CR6","unstructured":"Haynes TW, Hedetniemi ST, Slater PJ (1998a) Fundamentals of domination in graphs. Marcel Dekker Inc., New York"},{"key":"9879_CR7","unstructured":"Haynes TW, Hedetniemi ST, Slater PJ (1998b) Domination in graphs: advanced topics. Marcel Dekker Inc., New York"},{"key":"9879_CR8","doi-asserted-by":"crossref","first-page":"84","DOI":"10.1016\/j.tcs.2012.11.035","volume":"476","author":"JK Lana","year":"2013","unstructured":"Lana JK, Chang GJ (2013) On the mixed domination problem in graphs. Theor Comput Sci 476:84\u201393","journal-title":"Theor Comput Sci"},{"key":"9879_CR9","doi-asserted-by":"crossref","first-page":"1157","DOI":"10.1007\/s11425-007-0053-0","volume":"50","author":"XZ Lv","year":"2007","unstructured":"Lv XZ (2007) A lower bound on the total signed domination numbers of graphs. Sci China Ser A 50:1157\u20131162","journal-title":"Sci China Ser A"},{"key":"9879_CR10","doi-asserted-by":"crossref","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. Discrete Appl Math 91:155\u2013175","journal-title":"Discrete Appl Math"},{"key":"9879_CR11","doi-asserted-by":"crossref","first-page":"712","DOI":"10.1080\/00207160.2014.920832","volume":"92","author":"EF Shan","year":"2015","unstructured":"Shan EF, Zhao Y (2015) Signed mixed dominating functions in complete bipartite graphs. Int J Comput Math 92:712\u2013721","journal-title":"Int J Comput Math"},{"key":"9879_CR12","doi-asserted-by":"publisher","unstructured":"Sheikholeslami SM, Volkmann L (2013) Signed Roman domination number of a digraph. J Comb Optim. doi: 10.1007\/s10878-013-9648-2","DOI":"10.1007\/s10878-013-9648-2"},{"key":"9879_CR13","doi-asserted-by":"crossref","first-page":"85","DOI":"10.5614\/ejgta.2015.3.1.9","volume":"3","author":"SM Sheikholeslami","year":"2015","unstructured":"Sheikholeslami SM, Volkmann L (2015) The signed Roman domatic number of a digraph. Electron J Graph Theory Appl 3:85\u201393","journal-title":"Electron J Graph Theory Appl"},{"key":"9879_CR14","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"},{"key":"9879_CR15","volume-title":"Introduction to graph theory","author":"DB West","year":"2001","unstructured":"West DB (2001) Introduction to graph theory, 2nd edn. Prentice Hall, USA","edition":"2"},{"key":"9879_CR16","doi-asserted-by":"crossref","first-page":"49","DOI":"10.21136\/MB.2002.133984","volume":"127","author":"B Zelinka","year":"2002","unstructured":"Zelinka B (2002) On signed edge domination numbers of trees. Math Bohemica 127:49\u201355","journal-title":"Math Bohemica"},{"key":"9879_CR17","doi-asserted-by":"crossref","first-page":"2387","DOI":"10.1016\/j.tcs.2011.01.029","volume":"412","author":"Y Zhao","year":"2011","unstructured":"Zhao Y, Kang LY, Sohn MY (2011) The algorithmic complexity of mixed domination in graphs. Theor Comput Sci 412:2387\u20132392","journal-title":"Theor Comput Sci"},{"key":"9879_CR18","first-page":"112","volume":"33","author":"CW Zhou","year":"2010","unstructured":"Zhou CW (2010) Vertex-edge total signed domination number of a complete graph with even order. Acta Math Appl Sin 33:112\u2013117","journal-title":"Acta Math Appl Sin"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-015-9879-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-015-9879-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-015-9879-5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,9,1]],"date-time":"2020-09-01T10:59:36Z","timestamp":1598957976000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-015-9879-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,4,28]]},"references-count":18,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2016,7]]}},"alternative-id":["9879"],"URL":"https:\/\/doi.org\/10.1007\/s10878-015-9879-5","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,4,28]]}}}