{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,9]],"date-time":"2026-05-09T16:36:40Z","timestamp":1778344600615,"version":"3.51.4"},"reference-count":22,"publisher":"MDPI AG","issue":"9","license":[{"start":{"date-parts":[[2019,9,15]],"date-time":"2019-09-15T00:00:00Z","timestamp":1568505600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"name":"Spanish Ministry of Economy, Industry and Competitiveness","award":["MTM2016-78227-C2-1-P"],"award-info":[{"award-number":["MTM2016-78227-C2-1-P"]}]},{"name":"Spanish Ministry of Economy, Industry and Competitiveness","award":["MTM2017-90584-REDT"],"award-info":[{"award-number":["MTM2017-90584-REDT"]}]}],"content-domain":{"domain":["www.mdpi.com"],"crossmark-restriction":true},"short-container-title":["Symmetry"],"abstract":"<jats:p>A total dominating set D of a graph G is said to be a secure total dominating set if for every vertex     u \u2208 V ( G ) \\ D    , there exists a vertex     v \u2208 D    , which is adjacent to u, such that     ( D \\ { v } ) \u222a { u }     is a total dominating set as well. The secure total domination number of G is the minimum cardinality among all secure total dominating sets of G. In this article, we obtain new relationships between the secure total domination number and other graph parameters: namely the independence number, the matching number and other domination parameters. Some of our results are tight bounds that improve some well-known results.<\/jats:p>","DOI":"10.3390\/sym11091165","type":"journal-article","created":{"date-parts":[[2019,9,16]],"date-time":"2019-09-16T03:17:57Z","timestamp":1568603877000},"page":"1165","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":10,"title":["On the Secure Total Domination Number of Graphs"],"prefix":"10.3390","volume":"11","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-2806-4842","authenticated-orcid":false,"given":"Abel","family":"Cabrera Mart\u00ednez","sequence":"first","affiliation":[{"name":"Departament d\u2019Enginyeria Inform\u00e0tica i Matem\u00e0tiques, Universitat Rovira i Virgili, Av. Pa\u00efsos Catalans 26, 43007 Tarragona, Spain"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Luis P.","family":"Montejano","sequence":"additional","affiliation":[{"name":"Euncet University Business School, Universitat Polit\u00e8cnica de Catalunya, 08225 Terrassa, Spain"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9082-7647","authenticated-orcid":false,"given":"Juan A.","family":"Rodr\u00edguez-Vel\u00e1zquez","sequence":"additional","affiliation":[{"name":"Departament d\u2019Enginyeria Inform\u00e0tica i Matem\u00e0tiques, Universitat Rovira i Virgili, Av. Pa\u00efsos Catalans 26, 43007 Tarragona, Spain"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"1968","published-online":{"date-parts":[[2019,9,15]]},"reference":[{"key":"ref_1","first-page":"19","article-title":"Protection of a graph","volume":"67","author":"Cockayne","year":"2005","journal-title":"Util. Math."},{"key":"ref_2","unstructured":"Haynes, T.W., Hedetniemi, S.T., and Slater, P.J. (1998). Domination in Graphs: Volume 2: Advanced Topics, Taylor & Francis Group. Chapman & Hall\/CRC Pure and Applied Mathematics."},{"key":"ref_3","doi-asserted-by":"crossref","unstructured":"Haynes, T.W., Hedetniemi, S.T., and Slater, P.J. (1998). Fundamentals of Domination in Graphs, Marcel Dekker, Inc.","DOI":"10.1002\/(SICI)1097-0037(199810)32:3<199::AID-NET4>3.0.CO;2-F"},{"key":"ref_4","doi-asserted-by":"crossref","unstructured":"Henning, M.A., and Yeo, A. (2013). Total Domination in Graphs, Springer Monographs in Mathematics, Springer.","DOI":"10.1007\/978-1-4614-6525-6"},{"key":"ref_5","doi-asserted-by":"crossref","first-page":"786","DOI":"10.1016\/j.ipl.2015.05.006","article-title":"On secure domination in graphs","volume":"115","author":"Chellali","year":"2015","journal-title":"Inform. Process. Lett."},{"key":"ref_6","doi-asserted-by":"crossref","first-page":"163","DOI":"10.2989\/QM.2008.31.2.5.477","article-title":"Vertex covers and secure domination in graphs","volume":"31","author":"Burger","year":"2008","journal-title":"Quaest. Math."},{"key":"ref_7","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1016\/j.dam.2014.06.016","article-title":"Bounds on weak Roman and 2-rainbow domination numbers","volume":"178","author":"Chellali","year":"2014","journal-title":"Discrete Appl. Math."},{"key":"ref_8","first-page":"87","article-title":"Secure domination, weak Roman domination and forbidden subgraphs","volume":"39","author":"Cockayne","year":"2003","journal-title":"Bull. Inst. Combin. Appl."},{"key":"ref_9","doi-asserted-by":"crossref","first-page":"267","DOI":"10.7151\/dmgt.1405","article-title":"Secure domination and secure total domination in graphs","volume":"28","author":"Klostermeyer","year":"2008","journal-title":"Discuss. Math. Graph Theory"},{"key":"ref_10","doi-asserted-by":"crossref","first-page":"319","DOI":"10.2298\/FIL1901319V","article-title":"Protection of graphs with emphasis on Cartesian product graphs","volume":"33","author":"Valveny","year":"2019","journal-title":"Filomat"},{"key":"ref_11","first-page":"247","article-title":"Secure total domination in graphs","volume":"74","author":"Benecke","year":"2007","journal-title":"Util. Math."},{"key":"ref_12","doi-asserted-by":"crossref","unstructured":"Cabrera Mart\u00ednez, A., Montejano, L.P., and Rodr\u00edguez-Vel\u00e1zquez, J.A. (2019). Total weak Roman domination in graphs. Symmetry, 11.","DOI":"10.3390\/sym11060831"},{"key":"ref_13","first-page":"467","article-title":"Graphs with equal secure total domination and inverse secure total domination numbers","volume":"39","author":"Kulli","year":"2008","journal-title":"J. Inf. Optim. Sci."},{"key":"ref_14","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1016\/j.dam.2016.08.018","article-title":"Secure total domination in graphs: bounds and complexity","volume":"222","author":"Duginov","year":"2017","journal-title":"Discrete Appl. Math."},{"key":"ref_15","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1016\/S0012-365X(02)00811-7","article-title":"Defending the Roman Empire\u2014A new strategy","volume":"266","author":"Henning","year":"2003","journal-title":"Discrete Math."},{"key":"ref_16","doi-asserted-by":"crossref","first-page":"115","DOI":"10.7151\/dmgt.1532","article-title":"Weak Roman domination in graphs","volume":"31","author":"Pushpam","year":"2011","journal-title":"Discuss. Math. Graph Theory"},{"key":"ref_17","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1016\/j.dam.2018.03.039","article-title":"On the weak Roman domination number of lexicographic product graphs","volume":"263","author":"Valveny","year":"2019","journal-title":"Discrete Appl. Math."},{"key":"ref_18","doi-asserted-by":"crossref","first-page":"377","DOI":"10.7151\/dmgt.1500","article-title":"Total outer-connected domination numbers in trees","volume":"30","author":"Cyman","year":"2010","journal-title":"Discuss. Math. Graph Theory"},{"key":"ref_19","doi-asserted-by":"crossref","first-page":"3198","DOI":"10.1016\/j.dam.2009.06.027","article-title":"Total outer-connected domination numbers of trees","volume":"157","author":"Cyman","year":"2009","journal-title":"Discrete Appl. Math."},{"key":"ref_20","doi-asserted-by":"crossref","first-page":"451","DOI":"10.1007\/s10878-012-9531-6","article-title":"On the total outer-connected domination in graphs","volume":"27","author":"Favaron","year":"2014","journal-title":"J. Comb. Optim."},{"key":"ref_21","first-page":"223","article-title":"A note on total outer-connected domination numbers of a tree","volume":"7","author":"Hattingh","year":"2010","journal-title":"AKCE J. Graphs Comb."},{"key":"ref_22","doi-asserted-by":"crossref","first-page":"996","DOI":"10.1016\/j.aml.2011.01.013","article-title":"Bounds on the k-domination number of a graph","volume":"24","author":"Goddard","year":"2011","journal-title":"Appl. Math. Lett."}],"updated-by":[{"DOI":"10.3390\/sym13091668","type":"correction","label":"Correction","source":"publisher","updated":{"date-parts":[[2019,9,15]],"date-time":"2019-09-15T00:00:00Z","timestamp":1568505600000}}],"container-title":["Symmetry"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/2073-8994\/11\/9\/1165\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,3]],"date-time":"2025-08-03T22:28:36Z","timestamp":1754260116000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/2073-8994\/11\/9\/1165"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,9,15]]},"references-count":22,"journal-issue":{"issue":"9","published-online":{"date-parts":[[2019,9]]}},"alternative-id":["sym11091165"],"URL":"https:\/\/doi.org\/10.3390\/sym11091165","relation":{"correction":[{"id-type":"doi","id":"10.3390\/sym13091668","asserted-by":"object"}]},"ISSN":["2073-8994"],"issn-type":[{"value":"2073-8994","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,9,15]]}}}