{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,10]],"date-time":"2026-01-10T07:26:02Z","timestamp":1768029962909,"version":"3.49.0"},"reference-count":16,"publisher":"World Scientific Pub Co Pte Ltd","issue":"02","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Math. Algorithm. Appl."],"published-print":{"date-parts":[[2021,4]]},"abstract":"<jats:p> In this paper, selected domination parameters are discussed and proved especially after expanding the graph by duplicating vertices or edges. The tadpole domination number after expansion is obtained in terms of the old tadpole domination number and the maximal path of the original graph, tadpole domination number was determined for any graph after the duplication of the order of the vertices set of G or the duplication of the size of the edges set. Determining if a graph is Hamiltonian is much more problematic. Therefore, the leading outcome in this paper is that we provide that if an expanded graph (by duplicating each vertex by an edge) has tadpole domination, then the original (initial) graph has Hamiltonian path and vice versa. <\/jats:p>","DOI":"10.1142\/s1793830921500038","type":"journal-article","created":{"date-parts":[[2020,8,5]],"date-time":"2020-08-05T15:21:21Z","timestamp":1596640881000},"page":"2150003","source":"Crossref","is-referenced-by-count":8,"title":["Tadpole domination in duplicated graphs"],"prefix":"10.1142","volume":"13","author":[{"given":"M. N.","family":"Al-Harere","sequence":"first","affiliation":[{"name":"Department of Applied Sciences, University of Technology, Baghdad 10066\/UTC+3, Iraq"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6093-8963","authenticated-orcid":false,"given":"P. A.","family":"Khuda Bakhash","sequence":"additional","affiliation":[{"name":"Department of Applied Sciences, University of Technology, Baghdad 10066\/UTC+3, Iraq"}]}],"member":"219","published-online":{"date-parts":[[2020,9,10]]},"reference":[{"issue":"4","key":"S1793830921500038BIB001","doi-asserted-by":"crossref","first-page":"466","DOI":"10.21123\/bsj.15.4.466-471","volume":"15","author":"Al-Harere M. N.","year":"2018","journal-title":"Baghdad Sci. J."},{"issue":"32","key":"S1793830921500038BIB002","doi-asserted-by":"crossref","first-page":"1571","DOI":"10.12988\/ijma.2014.46175","volume":"8","author":"Arriola B. H.","year":"2014","journal-title":"Int. J. Math. Anal."},{"key":"S1793830921500038BIB003","volume-title":"The Theory of Graphs and its Applications","author":"Berge C.","year":"1962"},{"issue":"2","key":"S1793830921500038BIB004","first-page":"109","volume":"9","author":"Bibi K. A.","year":"2017","journal-title":"Indian J. Med. Res."},{"key":"S1793830921500038BIB005","first-page":"269","volume":"47","author":"Dettlaff M.","year":"2010","journal-title":"Australas. J. Combin."},{"key":"S1793830921500038BIB006","doi-asserted-by":"crossref","DOI":"10.21236\/AD0705364","volume-title":"Graph Theory","author":"Harary F.","year":"1969"},{"issue":"2","key":"S1793830921500038BIB007","first-page":"257","volume":"25","author":"Mahadevan G.","year":"2013","journal-title":"Ultra Sci."},{"issue":"5","key":"S1793830921500038BIB008","first-page":"260","volume":"2","author":"Mahadevan G.","year":"2012","journal-title":"Int. J. Eng. Res. Appl."},{"issue":"10","key":"S1793830921500038BIB009","first-page":"2229","volume":"4","author":"Mahadevan G.","year":"2013","journal-title":"Int. J. Math. Arch."},{"issue":"10","key":"S1793830921500038BIB010","first-page":"8882","volume":"12","author":"Omran A. A.","year":"2017","journal-title":"J. Eng. Appl. Sci."},{"key":"S1793830921500038BIB011","doi-asserted-by":"crossref","DOI":"10.1090\/coll\/038","volume-title":"Theory of Graphs","author":"Ore O.","year":"1962"},{"issue":"3","key":"S1793830921500038BIB012","first-page":"59","volume":"2","author":"Purohit G. N.","year":"2010","journal-title":"Int. J. Appl. Graph Theory in Wireless ad hoc Networks and Sensor Networks"},{"issue":"40","key":"S1793830921500038BIB013","first-page":"1965","volume":"7","author":"Sivagnanam C.","year":"2012","journal-title":"Int. Math. Forum."},{"issue":"22","key":"S1793830921500038BIB014","first-page":"33","volume":"4","author":"Subburaj J.","year":"2017","journal-title":"Int. J. Adv. Res. Eng. Technol."},{"issue":"1","key":"S1793830921500038BIB015","first-page":"1","volume":"9","author":"Thiagarajan K.","year":"2016","journal-title":"Indian J. Sci. Technol."},{"issue":"1","key":"S1793830921500038BIB016","first-page":"74","volume":"5","author":"Vaidya S. K.","year":"2015","journal-title":"J. Appl. Eng. Math."}],"container-title":["Discrete Mathematics, Algorithms and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S1793830921500038","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,2,8]],"date-time":"2021-02-08T16:57:07Z","timestamp":1612803427000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S1793830921500038"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,9,10]]},"references-count":16,"journal-issue":{"issue":"02","published-print":{"date-parts":[[2021,4]]}},"alternative-id":["10.1142\/S1793830921500038"],"URL":"https:\/\/doi.org\/10.1142\/s1793830921500038","relation":{},"ISSN":["1793-8309","1793-8317"],"issn-type":[{"value":"1793-8309","type":"print"},{"value":"1793-8317","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,9,10]]}}}