{"id":"https://openalex.org/W3047119574","doi":"https://doi.org/10.1142/s1793830921500038","title":"Tadpole domination in duplicated graphs","display_name":"Tadpole domination in duplicated graphs","publication_year":2020,"publication_date":"2020-08-05","ids":{"openalex":"https://openalex.org/W3047119574","doi":"https://doi.org/10.1142/s1793830921500038","mag":"3047119574"},"language":"en","primary_location":{"id":"doi:10.1142/s1793830921500038","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s1793830921500038","pdf_url":null,"source":{"id":"https://openalex.org/S178434951","display_name":"Discrete Mathematics Algorithms and Applications","issn_l":"1793-8309","issn":["1793-8309","1793-8317"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Discrete Mathematics, Algorithms and Applications","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5079726707","display_name":"Manal N. Al-Harere","orcid":"https://orcid.org/0000-0003-1125-4439"},"institutions":[{"id":"https://openalex.org/I171256487","display_name":"University of Technology - Iraq","ror":"https://ror.org/01w1ehb86","country_code":"IQ","type":"education","lineage":["https://openalex.org/I171256487"]}],"countries":["IQ"],"is_corresponding":false,"raw_author_name":"M. N. Al-Harere","raw_affiliation_strings":["Department of Applied Sciences, University of Technology, Baghdad 10066/UTC+3, Iraq"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Applied Sciences, University of Technology, Baghdad 10066/UTC+3, Iraq","institution_ids":["https://openalex.org/I171256487"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5020978452","display_name":"P. A. Khuda Bakhash","orcid":null},"institutions":[{"id":"https://openalex.org/I171256487","display_name":"University of Technology - Iraq","ror":"https://ror.org/01w1ehb86","country_code":"IQ","type":"education","lineage":["https://openalex.org/I171256487"]}],"countries":["IQ"],"is_corresponding":true,"raw_author_name":"P. A. Khuda Bakhash","raw_affiliation_strings":["Department of Applied Sciences, University of Technology, Baghdad 10066/UTC+3, Iraq"],"raw_orcid":"https://orcid.org/0000-0001-6093-8963","affiliations":[{"raw_affiliation_string":"Department of Applied Sciences, University of Technology, Baghdad 10066/UTC+3, Iraq","institution_ids":["https://openalex.org/I171256487"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5020978452"],"corresponding_institution_ids":["https://openalex.org/I171256487"],"apc_list":null,"apc_paid":null,"fwci":1.4451,"has_fulltext":false,"cited_by_count":11,"citation_normalized_percentile":{"value":0.86241399,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":"13","issue":"02","first_page":"2150003","last_page":"2150003"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9962000250816345,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9962000250816345,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12541","display_name":"Graph Labeling and Dimension Problems","score":0.9470000267028809,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9330000281333923,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/tadpole","display_name":"Tadpole (physics)","score":0.7981574535369873},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7142324447631836},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6631755232810974},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.6281060576438904},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5365574359893799},{"id":"https://openalex.org/keywords/hamiltonian-path","display_name":"Hamiltonian path","score":0.5355896949768066},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3939916789531708},{"id":"https://openalex.org/keywords/physics","display_name":"Physics","score":0.23476573824882507},{"id":"https://openalex.org/keywords/particle-physics","display_name":"Particle physics","score":0.046914875507354736}],"concepts":[{"id":"https://openalex.org/C2778311813","wikidata":"https://www.wikidata.org/wiki/Q7674671","display_name":"Tadpole (physics)","level":2,"score":0.7981574535369873},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7142324447631836},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6631755232810974},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.6281060576438904},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5365574359893799},{"id":"https://openalex.org/C86524685","wikidata":"https://www.wikidata.org/wiki/Q273037","display_name":"Hamiltonian path","level":3,"score":0.5355896949768066},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3939916789531708},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.23476573824882507},{"id":"https://openalex.org/C109214941","wikidata":"https://www.wikidata.org/wiki/Q18334","display_name":"Particle physics","level":1,"score":0.046914875507354736}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1142/s1793830921500038","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s1793830921500038","pdf_url":null,"source":{"id":"https://openalex.org/S178434951","display_name":"Discrete Mathematics Algorithms and Applications","issn_l":"1793-8309","issn":["1793-8309","1793-8317"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Discrete Mathematics, Algorithms and Applications","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":5,"referenced_works":["https://openalex.org/W2513829116","https://openalex.org/W4213214460","https://openalex.org/W4231139853","https://openalex.org/W4234142729","https://openalex.org/W4247549312"],"related_works":["https://openalex.org/W30750922","https://openalex.org/W1719252778","https://openalex.org/W922283457","https://openalex.org/W2008276241","https://openalex.org/W2555545330","https://openalex.org/W4287281963","https://openalex.org/W2374778222","https://openalex.org/W2056896777","https://openalex.org/W2142770065","https://openalex.org/W1966706905"],"abstract_inverted_index":{"In":[0],"this":[1,89],"paper,":[2],"selected":[3],"domination":[4,22,34,45],"parameters":[5],"are":[6],"discussed":[7],"and":[8,36,118],"proved":[9],"especially":[10],"after":[11,24,52],"expanding":[12],"the":[13,31,37,41,53,56,59,65,68,71,85,111],"graph":[14,51,77,99,114],"by":[15,104],"duplicating":[16,101],"vertices":[17,60],"or":[18,64],"edges.":[19],"The":[20],"tadpole":[21,33,44,108],"number":[23,35,46],"expansion":[25],"is":[26,78,80,91],"obtained":[27],"in":[28,88],"terms":[29],"of":[30,40,55,58,62,67,70],"old":[32],"maximal":[38],"path":[39,117],"original":[42,112],"graph,":[43],"was":[47],"determined":[48],"for":[49],"any":[50],"duplication":[54,66],"order":[57],"set":[61],"G":[63],"size":[69],"edges":[72],"set.":[73],"Determining":[74],"if":[75,96],"a":[76],"Hamiltonian":[79,116],"much":[81],"more":[82],"problematic.":[83],"Therefore,":[84],"leading":[86],"outcome":[87],"paper":[90],"that":[92,95],"we":[93],"provide":[94],"an":[97,105],"expanded":[98],"(by":[100],"each":[102],"vertex":[103],"edge)":[106],"has":[107,115],"domination,":[109],"then":[110],"(initial)":[113],"vice":[119],"versa.":[120]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":5},{"year":2021,"cited_by_count":4}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}
