On semi-transitive orientability of split graphs

IF 0.7 4区计算机科学 Q4 COMPUTER SCIENCE, INFORMATION SYSTEMS

Information Processing Letters Pub Date : 2023-09-01 DOI:10.1016/j.ipl.2023.106435

Sergey Kitaev , Artem Pyatkin

{"title":"On semi-transitive orientability of split graphs","authors":"Sergey Kitaev , Artem Pyatkin","doi":"10.1016/j.ipl.2023.106435","DOIUrl":null,"url":null,"abstract":"<div>A directed graph is semi-transitive if and only if it is acyclic and for any directed path <math><msub><mrow><mi>u</mi></mrow><mrow><mn>1</mn></mrow></msub><mo>→</mo><msub><mrow><mi>u</mi></mrow><mrow><mn>2</mn></mrow></msub><mo>→</mo><mo>⋯</mo><mo>→</mo><msub><mrow><mi>u</mi></mrow><mrow><mi>t</mi></mrow></msub></math>, <math><mi>t</mi><mo>≥</mo><mn>2</mn></math>, either there is no edge from <math><msub><mrow><mi>u</mi></mrow><mrow><mn>1</mn></mrow></msub></math> to <math><msub><mrow><mi>u</mi></mrow><mrow><mi>t</mi></mrow></msub></math> or all edges <math><msub><mrow><mi>u</mi></mrow><mrow><mi>i</mi></mrow></msub><mo>→</mo><msub><mrow><mi>u</mi></mrow><mrow><mi>j</mi></mrow></msub></math> exist for <math><mn>1</mn><mo>≤</mo><mi>i</mi><mo><</mo><mi>j</mi><mo>≤</mo><mi>t</mi></math>. An undirected graph is semi-transitive if it admits a semi-transitive orientation. Recognizing semi-transitive orientability of a graph is an NP-complete problem.A split graph is a graph in which the vertices can be partitioned into a clique and an independent set. Semi-transitive orientability of split graphs was recently studied in a series of papers in the literature. The main result in this paper is proving that recognition of semi-transitive orientability of split graphs can be done in a polynomial time.</div>","PeriodicalId":56290,"journal":{"name":"Information Processing Letters","volume":"184 ","pages":"Article 106435"},"PeriodicalIF":0.7000,"publicationDate":"2023-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Information Processing Letters","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0020019023000789","RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}

引用次数: 0

Abstract

A directed graph is semi-transitive if and only if it is acyclic and for any directed path $u_{1} \to u_{2} \to \dots \to u_{t}$ , $t \geq 2$ , either there is no edge from $u_{1}$ to $u_{t}$ or all edges $u_{i} \to u_{j}$ exist for $1 \leq i < j \leq t$ . An undirected graph is semi-transitive if it admits a semi-transitive orientation. Recognizing semi-transitive orientability of a graph is an NP-complete problem.

A split graph is a graph in which the vertices can be partitioned into a clique and an independent set. Semi-transitive orientability of split graphs was recently studied in a series of papers in the literature. The main result in this paper is proving that recognition of semi-transitive orientability of split graphs can be done in a polynomial time.

查看原文本刊更多论文

关于分裂图的半传递可定向性

有向图是半传递的当且仅当它是非循环的并且对于任何有向路径u1→u2→⋯→ut，t≥2，要么从u1到ut没有边，要么所有边ui→uj存在于1≤i<；j≤t。如果一个无向图允许一个半传递方向，那么它就是半传递图。识别图的半传递可定向性是一个NP完全问题。分裂图是一种可以将顶点划分为团和独立集的图。分裂图的半传递可定向性最近在一系列文献中进行了研究。本文的主要结果证明了分裂图的半传递可定向性的识别可以在多项式时间内完成。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文求助全文

来源期刊

Information Processing Letters 工程技术-计算机：信息系统

CiteScore

1.80

自引率

0.00%

发文量

审稿时长

7.3 months

期刊介绍： Information Processing Letters invites submission of original research articles that focus on fundamental aspects of information processing and computing. This naturally includes work in the broadly understood field of theoretical computer science; although papers in all areas of scientific inquiry will be given consideration, provided that they describe research contributions credibly motivated by applications to computing and involve rigorous methodology. High quality experimental papers that address topics of sufficiently broad interest may also be considered. Since its inception in 1971, Information Processing Letters has served as a forum for timely dissemination of short, concise and focused research contributions. Continuing with this tradition, and to expedite the reviewing process, manuscripts are generally limited in length to nine pages when they appear in print.