{"id":"https://openalex.org/W2471456266","doi":"https://doi.org/10.1142/s1793830916500555","title":"m-Eternal total domination in graphs","display_name":"m-Eternal total domination in graphs","publication_year":2016,"publication_date":"2016-06-26","ids":{"openalex":"https://openalex.org/W2471456266","doi":"https://doi.org/10.1142/s1793830916500555","mag":"2471456266"},"language":"en","primary_location":{"id":"doi:10.1142/s1793830916500555","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s1793830916500555","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/A5069800703","display_name":"P. Roushini Leely Pushpam","orcid":null},"institutions":[{"id":"https://openalex.org/I106826634","display_name":"Jain University","ror":"https://ror.org/01cnqpt53","country_code":"IN","type":"education","lineage":["https://openalex.org/I106826634"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"P. Roushini Leely Pushpam","raw_affiliation_strings":["Department of Mathematics, D.B. Jain College, Chennai 600 097, Tamil Nadu, India"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Mathematics, D.B. Jain College, Chennai 600 097, Tamil Nadu, India","institution_ids":["https://openalex.org/I106826634"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5072376261","display_name":"P. Shanthi","orcid":null},"institutions":[{"id":"https://openalex.org/I20107917","display_name":"Sri Ramachandra Institute of Higher Education and Research","ror":"https://ror.org/0108gdg43","country_code":"IN","type":"education","lineage":["https://openalex.org/I20107917"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"PA. Shanthi","raw_affiliation_strings":["Department of Mathematics, Sri Sairam Engineering College, Chennai 600 044, Tamil Nadu, India"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Mathematics, Sri Sairam Engineering College, Chennai 600 044, Tamil Nadu, India","institution_ids":["https://openalex.org/I20107917"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.3605,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.67338307,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"08","issue":"03","first_page":"1650055","last_page":"1650055"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9997000098228455,"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.9997000098228455,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9860000014305115,"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.9775000214576721,"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/guard","display_name":"Guard (computer science)","score":0.7780390977859497},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.639889657497406},{"id":"https://openalex.org/keywords/dominating-set","display_name":"Dominating set","score":0.5771839618682861},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5693328976631165},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5443950295448303},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3676779270172119},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3663940131664276},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.1463959813117981},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.05932188034057617}],"concepts":[{"id":"https://openalex.org/C141141315","wikidata":"https://www.wikidata.org/wiki/Q2379942","display_name":"Guard (computer science)","level":2,"score":0.7780390977859497},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.639889657497406},{"id":"https://openalex.org/C146661039","wikidata":"https://www.wikidata.org/wiki/Q2915204","display_name":"Dominating set","level":4,"score":0.5771839618682861},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5693328976631165},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5443950295448303},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3676779270172119},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3663940131664276},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.1463959813117981},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.05932188034057617}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1142/s1793830916500555","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s1793830916500555","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":7,"referenced_works":["https://openalex.org/W1493071618","https://openalex.org/W1956427314","https://openalex.org/W2003781275","https://openalex.org/W2013829476","https://openalex.org/W2405393314","https://openalex.org/W2799004609","https://openalex.org/W4213214460"],"related_works":["https://openalex.org/W2762120601","https://openalex.org/W2914864918","https://openalex.org/W4284991794","https://openalex.org/W2343275553","https://openalex.org/W2189152253","https://openalex.org/W1972605311","https://openalex.org/W2010333092","https://openalex.org/W2275356378","https://openalex.org/W2087307827","https://openalex.org/W1621490777"],"abstract_inverted_index":{"Eternal":[0],"domination":[1],"of":[2,8,18,31,46,53,64,104,116],"a":[3,34,75],"graph":[4,10],"requires":[5],"the":[6,9,26,29,51,65,93,102],"vertices":[7],"to":[11],"be":[12],"protected,":[13],"against":[14],"infinitely":[15],"long":[16],"sequences":[17],"attacks,":[19],"by":[20],"guards":[21,32,54,98,105],"located":[22],"at":[23,37,74],"vertices,":[24],"with":[25],"requirement":[27],"that":[28],"configuration":[30,52,103],"induces":[33,55,106],"dominating":[35,57],"set":[36],"all":[38,97],"times.":[39],"Klostermeyer":[40],"and":[41,77,108],"Mynhardt":[42],"studied":[43],"some":[44,114],"variations":[45],"this":[47,89,111],"concept":[48],"in":[49,68,79,95],"which":[50,69,80,96],"total":[56],"sets":[58],"(TDSs).":[59],"They":[60],"considered":[61],"two":[62],"models":[63],"problem,":[66],"one":[67,71,78,83],"only":[70],"guard":[72,84],"moves":[73],"time":[76],"more":[81],"than":[82],"may":[85],"move":[86,99],"simultaneously.":[87],"In":[88],"paper,":[90],"we":[91,109],"consider":[92],"model":[94,112],"simultaneously":[100],"when":[101],"TDSs":[107],"study":[110],"for":[113],"classes":[115],"graphs.":[117]},"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2016,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}