{"id":"https://openalex.org/W1754378632","doi":null,"title":"Domination Graphs of Tournaments and Digraphs","display_name":"Domination Graphs of Tournaments and Digraphs","publication_year":1995,"publication_date":"1995-05-01","ids":{"openalex":"https://openalex.org/W1754378632","mag":"1754378632"},"language":"en","primary_location":{"id":"pmh:oai:CiteSeerX.psu:10.1.1.48.4194","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.48.4194","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www-math.cudenver.edu/ccmreports/rep56.ps.gz","raw_type":"text"},"volume":null,"type":"article","indexed_in":[],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"David Fisher","orcid":"https://orcid.org/0000-0003-2999-5518","observed_orcids":["https://orcid.org/0000-0003-2999-5518"]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"David Fisher","raw_affiliation_strings":[],"raw_orcid":"https://orcid.org/0000-0003-2999-5518","affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5069334847","display_name":"J. Richard Lundgren","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"J. Richard Lundgren","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5068538083","display_name":"Sarah K. Merz","orcid":"https://orcid.org/0000-0002-9414-2880","observed_orcids":["https://orcid.org/0000-0002-9414-2880"]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Sarah K. Merz","raw_affiliation_strings":[],"raw_orcid":"https://orcid.org/0000-0002-9414-2880","affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5077335303","display_name":"K. B. Reid","orcid":"https://orcid.org/0000-0001-9205-0942","observed_orcids":["https://orcid.org/0000-0001-9205-0942"]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"K. B. Reid","raw_affiliation_strings":[],"raw_orcid":"https://orcid.org/0000-0001-9205-0942","affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.5103,"has_fulltext":false,"cited_by_count":18,"citation_normalized_percentile":{"value":0.60371341,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":95},"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9976000189781189,"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.9976000189781189,"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.0007999999797903001,"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"}},{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.0003000000142492354,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/tournaments","display_name":"tournaments","score":0.9139999747276306},{"id":"https://openalex.org/keywords/directed-graphs","display_name":"directed graphs","score":0.8790000081062317},{"id":"https://openalex.org/keywords/oriented-graphs","display_name":"oriented graphs","score":0.9919999837875366},{"id":"https://openalex.org/keywords/odd-cycles","display_name":"odd cycles","score":0.828000009059906},{"id":"https://openalex.org/keywords/caterpillars","display_name":"caterpillars","score":0.996999979019165},{"id":"https://openalex.org/keywords/graph-realization","display_name":"graph realization","score":0.36399999260902405},{"id":"https://openalex.org/keywords/path-graphs","display_name":"path graphs","score":0.37400001287460327},{"id":"https://openalex.org/keywords/edge-count","display_name":"edge count","score":0.503000020980835}],"concepts":[{"id":"https://openalex.org/C136975688","wikidata":"https://www.wikidata.org/wiki/Q1320634","display_name":"Tournament","level":2,"score":0.898686408996582},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.8629106879234314},{"id":"https://openalex.org/C2779145032","wikidata":"https://www.wikidata.org/wiki/Q191494","display_name":"Digraph","level":2,"score":0.7213766574859619},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.6543457508087158},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6439542174339294},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5111928582191467},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.42401063442230225}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:CiteSeerX.psu:10.1.1.48.4194","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.48.4194","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www-math.cudenver.edu/ccmreports/rep56.ps.gz","raw_type":"text"},{"id":"mag:1754378632","doi":null,"is_oa":false,"landing_page_url":"http://dl.acm.org/citation.cfm?id=865650&coll=DL&dl=GUIDE","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":null}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":3,"referenced_works":["https://openalex.org/W1662556199","https://openalex.org/W2045793488","https://openalex.org/W2083748041"],"related_works":["https://openalex.org/W1520016393","https://openalex.org/W7098998272","https://openalex.org/W2577245499","https://openalex.org/W2166399498","https://openalex.org/W7096724756","https://openalex.org/W2010833754","https://openalex.org/W2753936400","https://openalex.org/W1968941939","https://openalex.org/W187157619","https://openalex.org/W35929062"],"abstract_inverted_index":{"The":[0],"domination":[1,37,79,100,116,125,149],"graph":[2,38,64,80,101,117,126,150],"of":[3,28,39,57,66,81,102,118,127,145,151],"a":[4,40,55,106,128,152],"digraph":[5,12],"has":[6],"the":[7,11,29,32,36,78,99,115,124,140,148],"same":[8],"vertices":[9,18,76,112],"as":[10],"with":[13,47,70],"an":[14,44,67],"edge":[15],"between":[16],"two":[17],"if":[19],"every":[20],"other":[21],"vertex":[22],"loses":[23],"to":[24,89,130],"at":[25],"least":[26],"one":[27],"two.":[30],"Previously,":[31],"authors":[33],"showed":[34,61],"that":[35,62,95],"tournament":[41,129],"is":[42,77,98,113],"either":[43],"odd":[45,68],"cycle":[46,69],"or":[48,54,71,110],"without":[49,72],"isolated":[50,73],"and/or":[51,74],"pendant":[52,75],"vertices,":[53],"forest":[56],"caterpillars.":[58],"They":[59],"also":[60,93],"any":[63,96,119],"consisting":[65],"some":[82,103],"tournament.":[83,120,153],"This":[84],"paper":[85],"extends":[86],"these":[87],"results":[88,122],"oriented":[90],"graphs.":[91],"We":[92],"show":[94],"caterpillar":[97],"digraph,":[104],"but":[105],"path":[107],"on":[108],"four":[109],"more":[111],"not":[114],"Other":[121],"relate":[123],"its":[131],"positive":[132],"subtournament":[133],"defined":[134],"by":[135],"Fisher":[136],"and":[137,139,142],"Ryan,":[138],"possible":[141],"average":[143],"number":[144],"edges":[146],"in":[147]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2020,"cited_by_count":2}],"updated_date":"2026-10-14T16:39:01.820549","created_date":"2016-06-24T00:00:00"}