{"id":"https://openalex.org/W2159206777","doi":"https://doi.org/10.37236/115","title":"Reachability Relations and the Structure of Transitive Digraphs","display_name":"Reachability Relations and the Structure of Transitive Digraphs","publication_year":2009,"publication_date":"2009-02-27","ids":{"openalex":"https://openalex.org/W2159206777","doi":"https://doi.org/10.37236/115","mag":"2159206777"},"language":"en","primary_location":{"id":"doi:10.37236/115","is_oa":true,"landing_page_url":"https://doi.org/10.37236/115","pdf_url":"https://www.combinatorics.org/ojs/index.php/eljc/article/download/v16i1r26/pdf","source":{"id":"https://openalex.org/S38448739","display_name":"The Electronic Journal of Combinatorics","issn_l":"1077-8926","issn":["1077-8926","1097-1440"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310317970","host_organization_name":"Electronic Journal of Combinatorics","host_organization_lineage":["https://openalex.org/P4310317970"],"host_organization_lineage_names":["Electronic Journal of Combinatorics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"The Electronic Journal of Combinatorics","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://www.combinatorics.org/ojs/index.php/eljc/article/download/v16i1r26/pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5057977093","display_name":"Norbert Seifter","orcid":"https://orcid.org/0000-0002-4941-0073"},"institutions":[{"id":"https://openalex.org/I182712176","display_name":"Montanuniversit\u00e4t Leoben","ror":"https://ror.org/02fhfw393","country_code":"AT","type":"education","lineage":["https://openalex.org/I182712176"]},{"id":"https://openalex.org/I4210119369","display_name":"Ural Branch of the Russian Academy of Sciences","ror":"https://ror.org/02s4h3z39","country_code":"RU","type":"facility","lineage":["https://openalex.org/I1313323035","https://openalex.org/I4210119369"]}],"countries":["AT","RU"],"is_corresponding":true,"raw_author_name":"Norbert Seifter","raw_affiliation_strings":["Russian Academy of Sciences, Ekaterinburg, Russia","Montanuniversit\u00e4t Leoben, Leoben, Austria"],"affiliations":[{"raw_affiliation_string":"Russian Academy of Sciences, Ekaterinburg, Russia","institution_ids":["https://openalex.org/I4210119369"]},{"raw_affiliation_string":"Montanuniversit\u00e4t Leoben, Leoben, Austria","institution_ids":["https://openalex.org/I182712176"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5042490259","display_name":"V. I. Trofimov","orcid":"https://orcid.org/0000-0003-4313-807X"},"institutions":[{"id":"https://openalex.org/I4210119369","display_name":"Ural Branch of the Russian Academy of Sciences","ror":"https://ror.org/02s4h3z39","country_code":"RU","type":"facility","lineage":["https://openalex.org/I1313323035","https://openalex.org/I4210119369"]},{"id":"https://openalex.org/I182712176","display_name":"Montanuniversit\u00e4t Leoben","ror":"https://ror.org/02fhfw393","country_code":"AT","type":"education","lineage":["https://openalex.org/I182712176"]}],"countries":["AT","RU"],"is_corresponding":false,"raw_author_name":"Vladimir I. Trofimov","raw_affiliation_strings":["Montanuniversit\u00e4t Leoben, Leoben, Austria","Russian Academy of Sciences, Ekaterinburg, Russia"],"affiliations":[{"raw_affiliation_string":"Montanuniversit\u00e4t Leoben, Leoben, Austria","institution_ids":["https://openalex.org/I182712176"]},{"raw_affiliation_string":"Russian Academy of Sciences, Ekaterinburg, Russia","institution_ids":["https://openalex.org/I4210119369"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5057977093"],"corresponding_institution_ids":["https://openalex.org/I182712176","https://openalex.org/I4210119369"],"apc_list":null,"apc_paid":null,"fwci":0.3524,"has_fulltext":true,"cited_by_count":4,"citation_normalized_percentile":{"value":0.65180524,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"16","issue":"1","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.9995999932289124,"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.9995999932289124,"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/T11797","display_name":"graph theory and CDMA systems","score":0.9936000108718872,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10849","display_name":"Finite Group Theory Research","score":0.9929999709129333,"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.816189169883728},{"id":"https://openalex.org/keywords/digraph","display_name":"Digraph","score":0.8118520975112915},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7982006072998047},{"id":"https://openalex.org/keywords/transitive-relation","display_name":"Transitive relation","score":0.7452676296234131},{"id":"https://openalex.org/keywords/reachability","display_name":"Reachability","score":0.6963390111923218},{"id":"https://openalex.org/keywords/equivalence-relation","display_name":"Equivalence relation","score":0.6440781950950623},{"id":"https://openalex.org/keywords/integer","display_name":"Integer (computer science)","score":0.5576171278953552},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.44085007905960083},{"id":"https://openalex.org/keywords/strongly-connected-component","display_name":"Strongly connected component","score":0.413247287273407}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.816189169883728},{"id":"https://openalex.org/C2779145032","wikidata":"https://www.wikidata.org/wiki/Q191494","display_name":"Digraph","level":2,"score":0.8118520975112915},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7982006072998047},{"id":"https://openalex.org/C191399111","wikidata":"https://www.wikidata.org/wiki/Q64861","display_name":"Transitive relation","level":2,"score":0.7452676296234131},{"id":"https://openalex.org/C136643341","wikidata":"https://www.wikidata.org/wiki/Q1361526","display_name":"Reachability","level":2,"score":0.6963390111923218},{"id":"https://openalex.org/C156103551","wikidata":"https://www.wikidata.org/wiki/Q130998","display_name":"Equivalence relation","level":2,"score":0.6440781950950623},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.5576171278953552},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.44085007905960083},{"id":"https://openalex.org/C38754835","wikidata":"https://www.wikidata.org/wiki/Q2003238","display_name":"Strongly connected component","level":2,"score":0.413247287273407},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.37236/115","is_oa":true,"landing_page_url":"https://doi.org/10.37236/115","pdf_url":"https://www.combinatorics.org/ojs/index.php/eljc/article/download/v16i1r26/pdf","source":{"id":"https://openalex.org/S38448739","display_name":"The Electronic Journal of Combinatorics","issn_l":"1077-8926","issn":["1077-8926","1097-1440"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310317970","host_organization_name":"Electronic Journal of Combinatorics","host_organization_lineage":["https://openalex.org/P4310317970"],"host_organization_lineage_names":["Electronic Journal of Combinatorics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"The Electronic Journal of Combinatorics","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.37236/115","is_oa":true,"landing_page_url":"https://doi.org/10.37236/115","pdf_url":"https://www.combinatorics.org/ojs/index.php/eljc/article/download/v16i1r26/pdf","source":{"id":"https://openalex.org/S38448739","display_name":"The Electronic Journal of Combinatorics","issn_l":"1077-8926","issn":["1077-8926","1097-1440"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310317970","host_organization_name":"Electronic Journal of Combinatorics","host_organization_lineage":["https://openalex.org/P4310317970"],"host_organization_lineage_names":["Electronic Journal of Combinatorics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"The Electronic Journal of Combinatorics","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320321079","display_name":"Russian Foundation for Basic Research","ror":"https://ror.org/02mh1ke95"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2159206777.pdf","grobid_xml":"https://content.openalex.org/works/W2159206777.grobid-xml"},"referenced_works_count":14,"referenced_works":["https://openalex.org/W1992478452","https://openalex.org/W2004980855","https://openalex.org/W2008246697","https://openalex.org/W2031445715","https://openalex.org/W2042285959","https://openalex.org/W2058812404","https://openalex.org/W2059742569","https://openalex.org/W2068254936","https://openalex.org/W2078289947","https://openalex.org/W2093229750","https://openalex.org/W2093876788","https://openalex.org/W2114288806","https://openalex.org/W2164684058","https://openalex.org/W2169962394"],"related_works":["https://openalex.org/W2130254085","https://openalex.org/W2050086418","https://openalex.org/W1994118386","https://openalex.org/W4328134329","https://openalex.org/W2909679341","https://openalex.org/W2033567934","https://openalex.org/W2782194400","https://openalex.org/W2365236566","https://openalex.org/W4206573252","https://openalex.org/W2023776467"],"abstract_inverted_index":{"In":[0],"this":[1],"paper":[2],"we":[3,120,161,186],"investigate":[4,162,187],"reachability":[5],"relations":[6,106,110,159],"on":[7,111],"the":[8,22,29,35,42,71,84,105,158,163,167],"vertices":[9,52],"of":[10,24,31,44,62,73,76,157,166,194],"digraphs.":[11,127,184,226],"If":[12],"$W$":[13,25],"is":[14,26,81,97,140],"a":[15,18,60,90,98,124],"walk":[16,61],"in":[17,34,83,179],"digraph":[19],"$D$,":[20],"then":[21],"height":[23,63,72],"equal":[27],"to":[28,48,135,142,172],"number":[30,43],"edges":[32,45],"traversed":[33,46],"direction":[36],"coinciding":[37],"with":[38,133,170,205,207,210],"their":[39,49],"orientation,":[40],"minus":[41],"opposite":[47],"orientation.":[50],"Two":[51],"$u,v\\in":[53],"V(D)$":[54],"are":[55,108],"$R_{a,b}$-related":[56],"if":[57],"there":[58],"exists":[59],"$0$":[64],"between":[65],"$u$":[66],"and":[67,95,117,137,150,174,222],"$v$":[68],"such":[69,200],"that":[70],"every":[74],"subwalk":[75],"$W$,":[77],"starting":[78],"at":[79],"$u$,":[80],"contained":[82],"interval":[85],"$[a,b]$,":[86],"where":[87],"$a$":[88],"ia":[89],"non-positive":[91],"integer":[92,100],"or":[93,101,209,216],"$a=-\\infty$":[94],"$b$":[96],"non-negative":[99],"$b=\\infty$.":[102],"Of":[103],"course":[104],"$R_{a,b}$":[107],"equivalence":[109],"$V(D)$.":[112],"Factorising":[113],"digraphs":[114,199,204,214],"by":[115],"$R_{a,\\infty}$":[116,138,175],"$R_{-\\infty,b}$,":[118],"respectively,":[119],"can":[121,176],"only":[122],"obtain":[123],"few":[125],"different":[126,145],"Depending":[128],"upon":[129],"these":[130,188],"factor":[131],"graphs":[132],"respect":[134,171],"$R_{-\\infty,b}$":[136,149,173],"it":[139],"possible":[141],"define":[143],"five":[144],"\"basic":[146,168],"relation-properties\"":[147,169],"for":[148,190],"$R_{a,\\infty}$,":[151],"respectively.":[152],"Besides":[153],"proving":[154],"general":[155],"properties":[156,189],"$R_{a,b}$,":[160],"question":[164],"which":[165],"occur":[177],"simultaneously":[178],"locally":[180,195],"finite":[181,196],"connected":[182,197],"transitive":[183,198,225],"Furthermore":[185],"some":[191],"particular":[192],"subclasses":[193],"as":[201],"Cayley":[202],"digraphs,":[203],"one,":[206],"two":[208],"infinitely":[211],"many":[212],"ends,":[213],"containing":[215,218],"not":[217],"certain":[219],"directed":[220],"subtrees,":[221],"highly":[223],"arc":[224]},"counts_by_year":[{"year":2016,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":1}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}