当前位置: X-MOL 学术Appl. Math. Comput. › 论文详情
Identifying codes in line digraphs
Applied Mathematics and Computation ( IF 3.092 ) Pub Date : 2020-05-21 , DOI: 10.1016/j.amc.2020.125357
C. Balbuena; C. Dalfó; B. Martínez-Barona

Given an integer ℓ ≥ 1, a (1, ≤ ℓ)-identifying code in a digraph is a dominating subset C of vertices such that all distinct subsets of vertices of cardinality at most ℓ have distinct closed in-neighborhoods within C. In this paper, we prove that every line digraph of minimum in-degree one does not admit a (1, ≤ ℓ)-identifying code for ℓ ≥ 3. Then we give a characterization so that a line digraph of a digraph different from a directed cycle of length 4 and minimum in-degree one admits a (1, ≤ 2)-identifying code. The identifying number of a digraph D, γ→ID(D), is the minimum size of all the identifying codes of D. We establish for digraphs without digons with both vertices of in-degree one that γ→ID(LD) is lower bounded by the number of arcs of D minus the number of vertices with out-degree at least one. Then we show that γ→ID(LD) attains the equality for a digraph having a 1-factor with minimum in-degree two and without digons with both vertices of in-degree two. We finish by giving an algorithm to construct identifying codes in oriented digraphs with minimum in-degree at least two and minimum out-degree at least one.
更新日期:2020-05-21

 

全部期刊列表>>
如何通过Nature平台传播科研成果
跟Nature、Science文章学绘图
隐藏1h前已浏览文章
课题组网站
新版X-MOL期刊搜索和高级搜索功能介绍
中洪博元
ACS材料视界
x-mol收录
南开大学
朱守非
廖良生
郭东升
西湖大学
伊利诺伊大学香槟分校
徐明华
中山大学化学工程与技术学院
试剂库存
天合科研
down
wechat
bug