Propagation tree decompositions and linearly independent vertices

被引：0
|
作者：
Mitchell, Lon [1 ]
机构：
[1] Univ S Florida, St Petersburg, FL 33701 USA
来源：
THEORETICAL COMPUTER SCIENCE | 2021年 / 849卷
关键词：
Propagation tree decompositions; Zero-forcing; OS-sets; Minimum semidefinite rank;
D O I：
10.1016/j.tcs.2020.10.016
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
We explore the relationship between propagation tree decompositions of a graph of a given size and the OS-sets of the same size, showing that each can generate the other. We give a short constructive proof that the OS-sets are in bijective correspondence with a subset of the propagation tree decompositions. (C) 2020 Elsevier B.V. All rights reserved.
引用
下载
收藏
页码：159 / 162
页数：4
相关论文
共 50 条
12345