{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T18:27:35Z","timestamp":1743100055086,"version":"3.40.3"},"publisher-location":"Cham","reference-count":37,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030678982"},{"type":"electronic","value":"9783030678999"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-67899-9_3","type":"book-chapter","created":{"date-parts":[[2021,1,28]],"date-time":"2021-01-28T00:05:55Z","timestamp":1611792355000},"page":"32-42","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Algorithmic Aspects of Total Roman and Total Double Roman Domination in Graphs"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-6589-8358","authenticated-orcid":false,"given":"Chakradhar","family":"Padamutham","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0972-1141","authenticated-orcid":false,"given":"Venkata Subba Reddy","family":"Palagiri","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,1,28]]},"reference":[{"key":"3_CR1","doi-asserted-by":"publisher","first-page":"501","DOI":"10.2298\/AADM160802017A","volume":"10","author":"H Abdollahzadeh Ahangar","year":"2016","unstructured":"Abdollahzadeh Ahangar, H., Henning, M.A., Samodivkin, V., Yero, I.G.: Total Roman domination in graphs. Appl. Anal. Discrete Math. 10, 501\u2013517 (2016). https:\/\/doi.org\/10.2298\/AADM160802017A","journal-title":"Appl. Anal. Discrete Math."},{"key":"3_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.dam.2017.06.014","volume":"232","author":"H Abdollahzadeh Ahangar","year":"2017","unstructured":"Abdollahzadeh Ahangar, H., Chellali, M., Sheikholeslami, S.M.: On the double Roman domination in graphs. Discrete Appl. Math. 232, 1\u20137 (2017). https:\/\/doi.org\/10.1016\/j.dam.2017.06.014","journal-title":"Discrete Appl. Math."},{"key":"3_CR3","doi-asserted-by":"publisher","first-page":"125444","DOI":"10.1016\/j.amc.2020.125444","volume":"391","author":"H Abdollahzadeh Ahangar","year":"2021","unstructured":"Abdollahzadeh Ahangar, H., \u00c1lvarez, M.P., Chellali, M., Sheikholeslami, S.M., Valenzuela-Tripodoro, J.C.: Triple Roman domination in graphs. Appl. Math. Comput. 391, 125444 (2021). https:\/\/doi.org\/10.1016\/j.amc.2020.125444","journal-title":"Appl. Math. Comput."},{"key":"3_CR4","doi-asserted-by":"publisher","first-page":"124617","DOI":"10.1016\/j.amc.2019.124617","volume":"364","author":"H Abdollahzadeh Ahangar","year":"2020","unstructured":"Abdollahzadeh Ahangar, H., Chellali, M., Sheikholeslami, S.M.: Outer independent double Roman domination. Appl. Math. Comput. 364, 124617 (2020). https:\/\/doi.org\/10.1016\/j.amc.2019.124617","journal-title":"Appl. Math. Comput."},{"key":"3_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.dam.2018.09.009","volume":"257","author":"H Abdollahzadeh Ahangar","year":"2019","unstructured":"Abdollahzadeh Ahangar, H., Chellali, M., Sheikholeslami, S.M.: Signed double Roman domination in graphs. Discrete Appl. Math. 257, 1\u20131 (2019). https:\/\/doi.org\/10.1016\/j.dam.2018.09.009","journal-title":"Discrete Appl. Math."},{"key":"3_CR6","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1016\/S0304-3975(98)00158-3","volume":"237","author":"P Alimonti","year":"2000","unstructured":"Alimonti, P., Kann, V.: Some APX-completeness results for cubic graphs. Theor. Comput. Sci. 237, 123\u2013134 (2000). https:\/\/doi.org\/10.1016\/S0304-3975(98)00158-3","journal-title":"Theor. Comput. Sci."},{"key":"3_CR7","first-page":"271","volume":"69","author":"J Amjadi","year":"2017","unstructured":"Amjadi, J., Nazari-Moghaddam, S., Sheikholeslami, S.M.: Total Roman domination number of trees. Australas. J. Combin. 69, 271\u2013285 (2017)","journal-title":"Australas. J. Combin."},{"key":"3_CR8","doi-asserted-by":"publisher","first-page":"198","DOI":"10.1016\/j.dam.2018.03.026","volume":"244","author":"V Anu","year":"2018","unstructured":"Anu, V., Aparna Lakshmanan, S.: Double Roman domination number. Discrete Appl. Math. 244, 198\u2013204 (2018). https:\/\/doi.org\/10.1016\/j.dam.2018.03.026","journal-title":"Discrete Appl. Math."},{"key":"3_CR9","doi-asserted-by":"publisher","first-page":"88","DOI":"10.1016\/j.dam.2018.06.008","volume":"263","author":"N Campanelli","year":"2019","unstructured":"Campanelli, N., Kuziak, D.: Total Roman domination in the lexicographic product of graphs. Discrete Appl. Math. 263, 88\u201395 (2019). https:\/\/doi.org\/10.1016\/j.dam.2018.06.008","journal-title":"Discrete Appl. Math."},{"key":"3_CR10","doi-asserted-by":"publisher","first-page":"1264","DOI":"10.1016\/j.ic.2008.07.003","volume":"206","author":"M Chleb\u00edk","year":"2008","unstructured":"Chleb\u00edk, M., Chleb\u00edkov\u00e1, J.: Approximation hardness of dominating set problems in bounded degree graphs. Inf. Comput. 206, 1264\u20131275 (2008). https:\/\/doi.org\/10.1016\/j.ic.2008.07.003","journal-title":"Inf. Comput."},{"key":"3_CR11","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1016\/j.disc.2003.06.004","volume":"278","author":"EJ Cockayne","year":"2004","unstructured":"Cockayne, E.J., Dreyer, P.A., Hedetniemi, S.M., Hedetniemi, S.T.: Roman domination in graphs. Discrete Math. 278, 11\u201322 (2004). https:\/\/doi.org\/10.1016\/j.disc.2003.06.004","journal-title":"Discrete Math."},{"key":"3_CR12","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1016\/0890-5401(90)90043-H","volume":"85","author":"B Courcelle","year":"1990","unstructured":"Courcelle, B.: The monadic second-order logic of graphs. I. Recognizable sets of finite graphs. Inf. Comput. 85, 12\u201375 (1990). https:\/\/doi.org\/10.1016\/0890-5401(90)90043-H","journal-title":"Inf. Comput."},{"key":"3_CR13","unstructured":"Dreyer, P.A.: Applications and variations of domination in graphs. Ph.D. thesis, Rutgers University, The State University of New Jersey, New Brunswick, New Jersey (2000)"},{"key":"3_CR14","doi-asserted-by":"publisher","first-page":"3447","DOI":"10.1016\/j.disc.2008.09.043","volume":"309","author":"O Favaron","year":"2009","unstructured":"Favaron, O., Karami, H., Khoeilar, R., Sheikholeslami, S.M.: On the Roman domination number of a graph. Discrete Math. 309, 3447\u20133451 (2009). https:\/\/doi.org\/10.1016\/j.disc.2008.09.043","journal-title":"Discrete Math."},{"key":"3_CR15","doi-asserted-by":"publisher","first-page":"27","DOI":"10.22049\/CCO.2019.26484.1118","volume":"5","author":"G Hao","year":"2020","unstructured":"Hao, G., Volkmann, L., Mojdeh, D.A.: Total double Roman domination in graphs. Commun. Comb. Optim. 5, 27\u201339 (2020). https:\/\/doi.org\/10.22049\/CCO.2019.26484.1118","journal-title":"Commun. Comb. Optim."},{"key":"3_CR16","volume-title":"Fundamentals of Domination in Graphs","author":"TW Haynes","year":"1998","unstructured":"Haynes, T.W., Hedetniemi, S., Slater, P.: Fundamentals of Domination in Graphs. CRC Press, Boca Raton (1998)"},{"key":"3_CR17","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4614-6525-6","volume-title":"Total Domination in Graphs","author":"MA Henning","year":"2013","unstructured":"Henning, M.A., Yeo, A.: Total Domination in Graphs. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-1-4614-6525-6"},{"key":"3_CR18","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1016\/S0012-365X(03)00040-2","volume":"271","author":"M Henning","year":"2003","unstructured":"Henning, M.: Defending the Roman empire from multiple attacks. Discrete Math. 271, 101\u2013115 (2003). https:\/\/doi.org\/10.1016\/S0012-365X(03)00040-2","journal-title":"Discrete Math."},{"key":"3_CR19","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1016\/S0012-365X(02)00811-7","volume":"266","author":"MA Henning","year":"2003","unstructured":"Henning, M.A., Hedetniemi, S.T.: Defending the Roman empire\u2013a new strategy. Discrete Math. 266, 239\u2013251 (2003). https:\/\/doi.org\/10.1016\/S0012-365X(02)00811-7","journal-title":"Discrete Math."},{"key":"3_CR20","doi-asserted-by":"publisher","first-page":"325","DOI":"10.7151\/dmgt.1178","volume":"22","author":"M Henning","year":"2002","unstructured":"Henning, M.: A characterization of Roman trees. Discuss. Math. Graph Theory 22, 325\u2013334 (2002). https:\/\/doi.org\/10.7151\/dmgt.1178","journal-title":"Discuss. Math. Graph Theory"},{"key":"3_CR21","unstructured":"Liedloff, M., Kloks, T., Liu, J., Peng, S.H.: Roman domination in some special classes of graphs. Report TR-MA-04-01 (2004)"},{"key":"3_CR22","doi-asserted-by":"publisher","first-page":"608","DOI":"10.1007\/s10878-012-9482-y","volume":"26","author":"CH Liu","year":"2013","unstructured":"Liu, C.H., Chang, G.J.: Roman domination on strongly chordal graphs. J. Comb. Optim. 26, 608\u2013619 (2013). https:\/\/doi.org\/10.1007\/s10878-012-9482-y","journal-title":"J. Comb. Optim."},{"key":"3_CR23","volume-title":"Threshold Graphs and Related Topics","author":"N Mahadev","year":"1995","unstructured":"Mahadev, N., Peled, U.: Threshold Graphs and Related Topics. Elsevier, North Holland (1995)"},{"key":"3_CR24","doi-asserted-by":"publisher","unstructured":"Padamutham, C., Palagiri, V.S.R.: Complexity of Roman $$\\{$$2$$\\}$$-domination and the double Roman domination in graphs. AKCE Int. J. Graphs Comb. 1\u20136 (2020). https:\/\/doi.org\/10.1016\/j.akcej.2020.01.005","DOI":"10.1016\/j.akcej.2020.01.005"},{"key":"3_CR25","doi-asserted-by":"publisher","unstructured":"Padamutham, C., Palagiri, V.S.R.: Algorithmic aspects of Roman domination in graphs. J. Appl. Math. Comput. 89\u2013102 (2020). https:\/\/doi.org\/10.1007\/s12190-020-01345-4","DOI":"10.1007\/s12190-020-01345-4"},{"key":"3_CR26","doi-asserted-by":"publisher","first-page":"425","DOI":"10.1016\/0022-0000(91)90023-X","volume":"43","author":"CH Papadimitriou","year":"1991","unstructured":"Papadimitriou, C.H., Yannakakis, M.: Optimization, approximation, and complexity classes. J. Comput. Syst. Sci. 43, 425\u2013440 (1991). https:\/\/doi.org\/10.1016\/0022-0000(91)90023-X","journal-title":"J. Comput. Syst. Sci."},{"issue":"3","key":"3_CR27","doi-asserted-by":"publisher","first-page":"747","DOI":"10.1007\/s10878-019-00514-x","volume":"39","author":"A Poureidi","year":"2019","unstructured":"Poureidi, A., Rad, N.J.: Algorithmic and complexity aspects of problems related to total Roman domination for graphs. J. Combin. Optim. 39(3), 747\u2013763 (2019). https:\/\/doi.org\/10.1007\/s10878-019-00514-x","journal-title":"J. Combin. Optim."},{"key":"3_CR28","first-page":"167","volume":"19","author":"NJ Rad","year":"2019","unstructured":"Rad, N.J., Volkmann, L.: Roman domination perfect graphs. An. Stiint. Univ. Ovidius Constanta Ser. Mat. 19, 167\u2013174 (2019)","journal-title":"An. Stiint. Univ. Ovidius Constanta Ser. Mat."},{"key":"3_CR29","unstructured":"R\u00f6hrig, H.: Tree decomposition: a feasibility study, Masters\u2019s thesis, Max-Planck-Institut F\u00fcr Informatik, Citeseer (1998)"},{"key":"3_CR30","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1016\/j.dam.2016.03.017","volume":"211","author":"A Robert","year":"2016","unstructured":"Robert, A., Haynes, T.W., Hedetniemi, S.T.: Double Roman domination. Discrete Appl. Math. 211, 23\u201329 (2016). https:\/\/doi.org\/10.1016\/j.dam.2016.03.017","journal-title":"Discrete Appl. Math."},{"key":"3_CR31","doi-asserted-by":"publisher","first-page":"585","DOI":"10.2307\/2589113","volume":"107","author":"CS ReVelle","year":"2000","unstructured":"ReVelle, C.S., Rosing, K.E.: Defendens imperium romanum: a classical problem in military strategy. Am. Math. Mon. 107, 585\u2013594 (2000). https:\/\/doi.org\/10.2307\/2589113","journal-title":"Am. Math. Mon."},{"key":"3_CR32","doi-asserted-by":"publisher","first-page":"136","DOI":"10.1038\/scientificamerican1299-136","volume":"281","author":"I Stewart","year":"1999","unstructured":"Stewart, I.: Defend the Roman empire!. Sci. Am. 281, 136\u2013138 (1999). https:\/\/doi.org\/10.1038\/scientificamerican1299-136","journal-title":"Sci. Am."},{"key":"3_CR33","doi-asserted-by":"publisher","first-page":"52035","DOI":"10.1109\/ACCESS.2019.2911659","volume":"7","author":"Z Shao","year":"2019","unstructured":"Shao, Z., Amjadi, J., Sheikholeslami, S., Valinavaz, M.: On the total double Roman domination. IEEE Access 7, 52035\u201352041 (2019). https:\/\/doi.org\/10.1109\/ACCESS.2019.2911659","journal-title":"IEEE Access"},{"key":"3_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"871","DOI":"10.1007\/978-3-540-30551-4_74","volume-title":"Algorithms and Computation","author":"R Uehara","year":"2004","unstructured":"Uehara, R., Uno, Y.: Efficient algorithms for the longest path problem. In: Fleischer, R., Trippen, G. (eds.) ISAAC 2004. LNCS, vol. 3341, pp. 871\u2013883. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-30551-4_74"},{"key":"3_CR35","volume-title":"Introduction to Graph Theory","author":"DB West","year":"2001","unstructured":"West, D.B.: Introduction to Graph Theory, vol. 2. Prentice Hall, Upper Saddle River (2001)"},{"key":"3_CR36","doi-asserted-by":"publisher","unstructured":"Yannakakis, M.: Node-and edge-deletion NP-complete problems. In: Proceedings of the Tenth Annual ACM Symposium on Theory of Computing, pp. 253\u2013264 (1978). https:\/\/doi.org\/10.1145\/800133.804355","DOI":"10.1145\/800133.804355"},{"key":"3_CR37","doi-asserted-by":"publisher","unstructured":"Zhu, J.: Approximation for minimum total dominating set. In: Proceedings of ICIS 09, Seoul, Korea, 24\u201326 November 2009, pp. 119\u2013124 (2009). https:\/\/doi.org\/10.1145\/1655925.1655948","DOI":"10.1145\/1655925.1655948"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-67899-9_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,1,28]],"date-time":"2021-01-28T00:07:04Z","timestamp":1611792424000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-67899-9_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030678982","9783030678999"],"references-count":37,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-67899-9_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"28 January 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CALDAM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Conference on Algorithms and Discrete Applied Mathematics","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Rupnagar","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"India","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 February 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 February 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"caldam2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.iitrpr.ac.in\/caldam2021\/index.html","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair and OCS","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"82","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"39","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"48% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2,8","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2,21","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}