Yuanrui Feng , Jun Ge , Douglas B. West , Yan Yang
{"title":"Some new results on bar visibility of digraphs","authors":"Yuanrui Feng , Jun Ge , Douglas B. West , Yan Yang","doi":"10.1016/j.dam.2024.09.024","DOIUrl":null,"url":null,"abstract":"<div><div>Visibility representation of digraphs was introduced by Axenovich et al. (2013) as a natural generalization of <span><math><mi>t</mi></math></span>-bar visibility representation of undirected graphs. A <span><math><mi>t</mi></math></span><em>-bar visibility representation</em> of a digraph <span><math><mi>G</mi></math></span> assigns each vertex at most <span><math><mi>t</mi></math></span> horizontal bars in the plane so that there is an arc <span><math><mrow><mi>x</mi><mi>y</mi></mrow></math></span> in the digraph if and only if some bar for <span><math><mi>x</mi></math></span> “sees” some bar for <span><math><mi>y</mi></math></span> above it along an unblocked vertical strip with positive width. The <em>visibility number</em> <span><math><mrow><mi>b</mi><mrow><mo>(</mo><mi>G</mi><mo>)</mo></mrow></mrow></math></span> is the least <span><math><mi>t</mi></math></span> such that <span><math><mi>G</mi></math></span> has a <span><math><mi>t</mi></math></span>-bar visibility representation. In this paper, we solve several problems about <span><math><mrow><mi>b</mi><mrow><mo>(</mo><mi>G</mi><mo>)</mo></mrow></mrow></math></span> posed by Axenovich et al. and prove that determining whether the bar visibility number of a digraph is 2 is NP-complete.</div></div>","PeriodicalId":50573,"journal":{"name":"Discrete Applied Mathematics","volume":"360 ","pages":"Pages 342-352"},"PeriodicalIF":1.0000,"publicationDate":"2024-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Discrete Applied Mathematics","FirstCategoryId":"100","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0166218X24004141","RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"MATHEMATICS, APPLIED","Score":null,"Total":0}
引用次数: 0
Abstract
Visibility representation of digraphs was introduced by Axenovich et al. (2013) as a natural generalization of -bar visibility representation of undirected graphs. A -bar visibility representation of a digraph assigns each vertex at most horizontal bars in the plane so that there is an arc in the digraph if and only if some bar for “sees” some bar for above it along an unblocked vertical strip with positive width. The visibility number is the least such that has a -bar visibility representation. In this paper, we solve several problems about posed by Axenovich et al. and prove that determining whether the bar visibility number of a digraph is 2 is NP-complete.
数图的可见性表示是由 Axenovich 等人(2013 年)提出的,是对无向图的 t 条可见性表示的自然概括。数图 G 的 t 条可见度表示法为每个顶点在平面上分配了最多 t 条水平条,因此当且仅当 x 的某个条沿着宽度为正的无阻挡垂直条 "看到 "其上方 y 的某个条时,数图中才有弧 xy。可见度数 b(G) 是 G 具有 t 条可见度表示的最小 t。在本文中,我们解决了阿克森诺维奇等人提出的几个关于 b(G) 的问题,并证明确定一个数图的条形可见度数是否为 2 是 NP-完全的。
期刊介绍:
The aim of Discrete Applied Mathematics is to bring together research papers in different areas of algorithmic and applicable discrete mathematics as well as applications of combinatorial mathematics to informatics and various areas of science and technology. Contributions presented to the journal can be research papers, short notes, surveys, and possibly research problems. The "Communications" section will be devoted to the fastest possible publication of recent research results that are checked and recommended for publication by a member of the Editorial Board. The journal will also publish a limited number of book announcements as well as proceedings of conferences. These proceedings will be fully refereed and adhere to the normal standards of the journal.
Potential authors are advised to view the journal and the open calls-for-papers of special issues before submitting their manuscripts. Only high-quality, original work that is within the scope of the journal or the targeted special issue will be considered.