{"id":"https://openalex.org/W2556113253","doi":"https://doi.org/10.1142/s1793830917500094","title":"Disjunctive total domination in permutation graphs","display_name":"Disjunctive total domination in permutation graphs","publication_year":2016,"publication_date":"2016-11-24","ids":{"openalex":"https://openalex.org/W2556113253","doi":"https://doi.org/10.1142/s1793830917500094","mag":"2556113253"},"language":"en","primary_location":{"id":"doi:10.1142/s1793830917500094","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s1793830917500094","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/A5028726850","display_name":"Eunjeong Yi","orcid":"https://orcid.org/0000-0002-7493-8398"},"institutions":[{"id":"https://openalex.org/I164185940","display_name":"Texas A&M University at Galveston","ror":"https://ror.org/00w0k4e67","country_code":"US","type":"education","lineage":["https://openalex.org/I164185940"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Eunjeong Yi","raw_affiliation_strings":["Texas A&M University at Galveston, Galveston, TX 77553, USA"],"affiliations":[{"raw_affiliation_string":"Texas A&M University at Galveston, Galveston, TX 77553, USA","institution_ids":["https://openalex.org/I164185940"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5028726850"],"corresponding_institution_ids":["https://openalex.org/I164185940"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.13868186,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":94,"max":96},"biblio":{"volume":"09","issue":"01","first_page":"1750009","last_page":"1750009"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9998999834060669,"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.9998999834060669,"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.9973000288009644,"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/T11329","display_name":"Limits and Structures in Graph Theory","score":0.9962999820709229,"subfield":{"id":"https://openalex.org/subfields/2607","display_name":"Discrete Mathematics and Combinatorics"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.791075587272644},{"id":"https://openalex.org/keywords/bijection","display_name":"Bijection","score":0.6272245645523071},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.6142107248306274},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5776438117027283},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3809624910354614},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.3710496127605438}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.791075587272644},{"id":"https://openalex.org/C24424167","wikidata":"https://www.wikidata.org/wiki/Q180907","display_name":"Bijection","level":2,"score":0.6272245645523071},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.6142107248306274},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5776438117027283},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3809624910354614},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3710496127605438}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1142/s1793830917500094","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s1793830917500094","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":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":18,"referenced_works":["https://openalex.org/W1493071618","https://openalex.org/W1530753374","https://openalex.org/W1581552469","https://openalex.org/W1967091137","https://openalex.org/W1974110893","https://openalex.org/W1993587964","https://openalex.org/W2006503776","https://openalex.org/W2011039300","https://openalex.org/W2016039405","https://openalex.org/W2019262465","https://openalex.org/W2065952419","https://openalex.org/W2066561381","https://openalex.org/W2088288979","https://openalex.org/W2089228910","https://openalex.org/W2098253895","https://openalex.org/W4231139853","https://openalex.org/W4241943798","https://openalex.org/W4247549312"],"related_works":["https://openalex.org/W4302772626","https://openalex.org/W4287081841","https://openalex.org/W1617133980","https://openalex.org/W4313160393","https://openalex.org/W1563975411","https://openalex.org/W3015761224","https://openalex.org/W3213496305","https://openalex.org/W4287686167","https://openalex.org/W3116969954","https://openalex.org/W1986950726"],"abstract_inverted_index":{"Let":[0,100],"[Formula:":[1,10,16,20,35,42,50,59,69,83,87,97,101,105,115,120,130,137,144,151,164,173,186,194,198,209],"see":[2,11,17,21,36,43,51,60,70,84,88,98,102,106,116,121,131,138,145,152,165,174,187,195,199,210],"text]":[3,12,22,37,44,52,61,71,85,89,103,107,122,132,139,153,175,188,196,200],"be":[4,108,123,177],"a":[5,28,39,56,113,124,127,202,204,207],"graph":[6,114,129,150],"with":[7],"vertex":[8,40,48,57,135],"set":[9,15,32,41,136,143],"and":[13,77,104,118,140,206],"edge":[14,142],"text].":[18,99,146],"If":[19],"has":[23,63,133],"no":[24],"isolated":[25],"vertex,":[26],"then":[27],"disjunctive":[29,79],"total":[30,80],"dominating":[31],"(DTD-set)":[33],"of":[34,58,86,96,112,154],"is":[38,53,90,201],"such":[45],"that":[46,172,193],"every":[47],"in":[49,68],"adjacent":[54],"to":[55],"or":[62],"at":[64,72,156],"least":[65,157],"two":[66,74,109],"vertices":[67],"distance":[73],"from":[75],"it,":[76],"the":[78,91,134,141,161],"domination":[81],"number":[82],"minimum":[92],"cardinality":[93],"overall":[94],"DTD-sets":[95],"disjoint":[110],"copies":[111],"text],":[117],"let":[119],"bijection.":[125],"Then,":[126],"permutation":[128,182],"For":[147],"any":[148],"connected":[149],"order":[155],"three,":[158],"we":[159,167,191],"prove":[160],"sharp":[162],"bounds":[163],"text];":[166],"give":[168],"an":[169],"example":[170],"showing":[171],"can":[176],"arbitrarily":[178],"large.":[179],"We":[180],"characterize":[181],"graphs":[183],"for":[184],"which":[185],"holds.":[189],"Further,":[190],"show":[192],"when":[197],"cycle,":[203],"path,":[205],"complete":[208],"text]-partite":[211],"graph,":[212],"respectively.":[213]},"counts_by_year":[{"year":2020,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}